java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 18:34:41,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 18:34:41,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 18:34:41,585 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 18:34:41,585 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 18:34:41,587 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 18:34:41,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 18:34:41,600 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 18:34:41,604 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 18:34:41,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 18:34:41,609 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 18:34:41,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 18:34:41,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 18:34:41,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 18:34:41,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 18:34:41,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 18:34:41,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 18:34:41,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 18:34:41,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 18:34:41,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 18:34:41,629 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 18:34:41,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 18:34:41,633 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 18:34:41,634 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 18:34:41,636 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 18:34:41,636 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 18:34:41,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 18:34:41,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 18:34:41,640 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 18:34:41,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 18:34:41,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 18:34:41,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 18:34:41,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 18:34:41,645 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 18:34:41,647 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 18:34:41,647 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 18:34:41,648 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 18:34:41,648 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 18:34:41,649 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 18:34:41,649 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 18:34:41,650 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 18:34:41,651 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 18:34:41,666 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 18:34:41,666 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 18:34:41,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 18:34:41,668 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 18:34:41,668 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 18:34:41,668 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 18:34:41,668 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 18:34:41,669 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 18:34:41,669 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 18:34:41,669 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 18:34:41,669 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 18:34:41,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 18:34:41,670 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 18:34:41,670 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 18:34:41,670 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 18:34:41,670 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 18:34:41,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 18:34:41,671 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 18:34:41,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 18:34:41,671 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 18:34:41,671 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 18:34:41,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 18:34:41,672 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 18:34:41,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 18:34:41,672 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 18:34:41,672 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 18:34:41,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 18:34:41,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 18:34:41,673 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 18:34:41,702 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 18:34:41,715 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 18:34:41,721 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 18:34:41,723 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 18:34:41,724 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 18:34:41,724 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2019-09-08 18:34:41,785 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdf82a0d/774f2a86e4804b1f8cceb6ce260e85de/FLAGab8f4d147 [2019-09-08 18:34:42,619 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 18:34:42,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2019-09-08 18:34:42,663 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdf82a0d/774f2a86e4804b1f8cceb6ce260e85de/FLAGab8f4d147 [2019-09-08 18:34:43,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dcdf82a0d/774f2a86e4804b1f8cceb6ce260e85de [2019-09-08 18:34:43,110 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 18:34:43,112 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 18:34:43,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 18:34:43,116 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 18:34:43,119 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 18:34:43,121 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:34:43" (1/1) ... [2019-09-08 18:34:43,124 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57e772a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:43, skipping insertion in model container [2019-09-08 18:34:43,124 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:34:43" (1/1) ... [2019-09-08 18:34:43,133 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 18:34:43,258 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 18:34:44,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 18:34:44,834 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 18:34:45,123 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 18:34:45,558 INFO L192 MainTranslator]: Completed translation [2019-09-08 18:34:45,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:45 WrapperNode [2019-09-08 18:34:45,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 18:34:45,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 18:34:45,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 18:34:45,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 18:34:45,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:45" (1/1) ... [2019-09-08 18:34:45,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:45" (1/1) ... [2019-09-08 18:34:45,713 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:45" (1/1) ... [2019-09-08 18:34:45,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:45" (1/1) ... [2019-09-08 18:34:45,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:45" (1/1) ... [2019-09-08 18:34:45,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:45" (1/1) ... [2019-09-08 18:34:46,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:45" (1/1) ... [2019-09-08 18:34:46,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 18:34:46,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 18:34:46,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 18:34:46,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 18:34:46,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:45" (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 18:34:46,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 18:34:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 18:34:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-09-08 18:34:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-09-08 18:34:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2019-09-08 18:34:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 18:34:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-08 18:34:46,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-09-08 18:34:46,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-09-08 18:34:46,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-08 18:34:46,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-08 18:34:46,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-08 18:34:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-08 18:34:46,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 18:34:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2019-09-08 18:34:46,166 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2019-09-08 18:34:46,169 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2019-09-08 18:34:46,170 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kzalloc [2019-09-08 18:34:46,170 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-09-08 18:34:46,170 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-09-08 18:34:46,171 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2019-09-08 18:34:46,171 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2019-09-08 18:34:46,171 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_while_busy [2019-09-08 18:34:46,171 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_for_read [2019-09-08 18:34:46,172 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_synchronize [2019-09-08 18:34:46,172 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read [2019-09-08 18:34:46,172 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read_increment_offset [2019-09-08 18:34:46,172 INFO L138 BoogieDeclarations]: Found implementation of procedure show_value [2019-09-08 18:34:46,172 INFO L138 BoogieDeclarations]: Found implementation of procedure show_alarm [2019-09-08 18:34:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure show_mask [2019-09-08 18:34:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure show_label [2019-09-08 18:34:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure show_name [2019-09-08 18:34:46,173 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_probe [2019-09-08 18:34:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_remove [2019-09-08 18:34:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_update_device [2019-09-08 18:34:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_suspend [2019-09-08 18:34:46,174 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_resume [2019-09-08 18:34:46,175 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_dmi_detect [2019-09-08 18:34:46,175 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_detect [2019-09-08 18:34:46,175 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_init [2019-09-08 18:34:46,175 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_exit [2019-09-08 18:34:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_probe_1 [2019-09-08 18:34:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_pm_ops_2 [2019-09-08 18:34:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_init_1 [2019-09-08 18:34:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 18:34:46,176 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-09-08 18:34:46,177 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-09-08 18:34:46,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_5 [2019-09-08 18:34:46,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_6 [2019-09-08 18:34:46,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_7 [2019-09-08 18:34:46,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_8 [2019-09-08 18:34:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-09-08 18:34:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_10 [2019-09-08 18:34:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-09-08 18:34:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_12 [2019-09-08 18:34:46,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_13 [2019-09-08 18:34:46,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___platform_driver_register_14 [2019-09-08 18:34:46,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_15 [2019-09-08 18:34:46,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_16 [2019-09-08 18:34:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 18:34:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2019-09-08 18:34:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-09-08 18:34:46,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-09-08 18:34:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-09-08 18:34:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-09-08 18:34:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-09-08 18:34:46,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-09-08 18:34:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-09-08 18:34:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-09-08 18:34:46,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-08 18:34:46,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-09-08 18:34:46,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-09-08 18:34:46,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_lock [2019-09-08 18:34:46,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_lock [2019-09-08 18:34:46,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_lock [2019-09-08 18:34:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_lock [2019-09-08 18:34:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-08 18:34:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-08 18:34:46,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-09-08 18:34:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-09-08 18:34:46,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-08 18:34:46,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-08 18:34:46,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-09-08 18:34:46,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mutex_of_device [2019-09-08 18:34:46,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mutex_of_device [2019-09-08 18:34:46,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-09-08 18:34:46,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mutex_of_device [2019-09-08 18:34:46,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru3_data [2019-09-08 18:34:46,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_update_lock_of_abituguru3_data [2019-09-08 18:34:46,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2019-09-08 18:34:46,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_update_lock_of_abituguru3_data [2019-09-08 18:34:46,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru3_data [2019-09-08 18:34:46,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_update_lock_of_abituguru3_data [2019-09-08 18:34:46,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2019-09-08 18:34:46,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_update_lock_of_abituguru3_data [2019-09-08 18:34:46,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_update_lock_of_abituguru3_data [2019-09-08 18:34:46,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_update_lock_of_abituguru3_data [2019-09-08 18:34:46,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_update_lock_of_abituguru3_data [2019-09-08 18:34:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 18:34:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2019-09-08 18:34:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-09-08 18:34:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure __platform_driver_register [2019-09-08 18:34:46,194 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2019-09-08 18:34:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2019-09-08 18:34:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kmalloc [2019-09-08 18:34:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure dmi_get_system_info [2019-09-08 18:34:46,195 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2019-09-08 18:34:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2019-09-08 18:34:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_complete_2 [2019-09-08 18:34:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_freeze_late_2 [2019-09-08 18:34:46,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_freeze_noirq_2 [2019-09-08 18:34:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 18:34:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_poweroff_late_2 [2019-09-08 18:34:46,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_poweroff_noirq_2 [2019-09-08 18:34:46,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_prepare_2 [2019-09-08 18:34:46,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_restore_early_2 [2019-09-08 18:34:46,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_restore_noirq_2 [2019-09-08 18:34:46,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_resume_early_2 [2019-09-08 18:34:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_resume_noirq_2 [2019-09-08 18:34:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_suspend_late_2 [2019-09-08 18:34:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_suspend_noirq_2 [2019-09-08 18:34:46,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_thaw_early_2 [2019-09-08 18:34:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_thaw_noirq_2 [2019-09-08 18:34:46,200 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2019-09-08 18:34:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-09-08 18:34:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-09-08 18:34:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-09-08 18:34:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2019-09-08 18:34:46,201 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add_resources [2019-09-08 18:34:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2019-09-08 18:34:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_put [2019-09-08 18:34:46,202 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2019-09-08 18:34:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2019-09-08 18:34:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2019-09-08 18:34:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 18:34:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure strncasecmp [2019-09-08 18:34:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 18:34:46,203 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 18:34:46,204 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-08 18:34:46,205 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-08 18:34:46,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 18:34:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 18:34:46,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 18:34:46,211 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 18:34:46,220 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2019-09-08 18:34:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-09-08 18:34:46,221 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-08 18:34:46,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-09-08 18:34:46,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-09-08 18:34:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-08 18:34:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-09-08 18:34:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-09-08 18:34:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-09-08 18:34:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-09-08 18:34:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2019-09-08 18:34:46,223 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-09-08 18:34:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 18:34:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-09-08 18:34:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-09-08 18:34:46,224 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-09-08 18:34:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-09-08 18:34:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_8 [2019-09-08 18:34:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-09-08 18:34:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_6 [2019-09-08 18:34:46,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-09-08 18:34:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-09-08 18:34:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_13 [2019-09-08 18:34:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 18:34:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 18:34:46,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 18:34:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-08 18:34:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 18:34:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 18:34:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 18:34:46,227 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 18:34:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-08 18:34:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-08 18:34:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-09-08 18:34:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-09-08 18:34:46,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-08 18:34:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-08 18:34:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-08 18:34:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-08 18:34:46,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-08 18:34:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-09-08 18:34:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_5 [2019-09-08 18:34:46,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_7 [2019-09-08 18:34:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_10 [2019-09-08 18:34:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_12 [2019-09-08 18:34:46,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-09-08 18:34:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-09-08 18:34:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-09-08 18:34:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-09-08 18:34:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-09-08 18:34:46,232 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2019-09-08 18:34:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2019-09-08 18:34:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2019-09-08 18:34:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2019-09-08 18:34:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2019-09-08 18:34:46,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_probe_1 [2019-09-08 18:34:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_pm_ops_2 [2019-09-08 18:34:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_init_1 [2019-09-08 18:34:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2019-09-08 18:34:46,234 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2019-09-08 18:34:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2019-09-08 18:34:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kmalloc [2019-09-08 18:34:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kzalloc [2019-09-08 18:34:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-09-08 18:34:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-09-08 18:34:46,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 18:34:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2019-09-08 18:34:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2019-09-08 18:34:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2019-09-08 18:34:46,236 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add_resources [2019-09-08 18:34:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2019-09-08 18:34:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_put [2019-09-08 18:34:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure __platform_driver_register [2019-09-08 18:34:46,237 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___platform_driver_register_14 [2019-09-08 18:34:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2019-09-08 18:34:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_15 [2019-09-08 18:34:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_16 [2019-09-08 18:34:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2019-09-08 18:34:46,238 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2019-09-08 18:34:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2019-09-08 18:34:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2019-09-08 18:34:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure dmi_get_system_info [2019-09-08 18:34:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_while_busy [2019-09-08 18:34:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 18:34:46,239 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_for_read [2019-09-08 18:34:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_synchronize [2019-09-08 18:34:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 18:34:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 18:34:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read [2019-09-08 18:34:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read_increment_offset [2019-09-08 18:34:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_update_device [2019-09-08 18:34:46,240 INFO L130 BoogieDeclarations]: Found specification of procedure show_value [2019-09-08 18:34:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure show_alarm [2019-09-08 18:34:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure show_mask [2019-09-08 18:34:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure show_label [2019-09-08 18:34:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure show_name [2019-09-08 18:34:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_probe [2019-09-08 18:34:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_remove [2019-09-08 18:34:46,241 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_suspend [2019-09-08 18:34:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_resume [2019-09-08 18:34:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_dmi_detect [2019-09-08 18:34:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_detect [2019-09-08 18:34:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_init [2019-09-08 18:34:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_exit [2019-09-08 18:34:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_suspend_late_2 [2019-09-08 18:34:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_restore_noirq_2 [2019-09-08 18:34:46,242 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_freeze_late_2 [2019-09-08 18:34:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_complete_2 [2019-09-08 18:34:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 18:34:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_thaw_early_2 [2019-09-08 18:34:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_poweroff_noirq_2 [2019-09-08 18:34:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_resume_noirq_2 [2019-09-08 18:34:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_resume_early_2 [2019-09-08 18:34:46,243 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_prepare_2 [2019-09-08 18:34:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 18:34:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_restore_early_2 [2019-09-08 18:34:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_suspend_noirq_2 [2019-09-08 18:34:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_poweroff_late_2 [2019-09-08 18:34:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_thaw_noirq_2 [2019-09-08 18:34:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_freeze_noirq_2 [2019-09-08 18:34:46,244 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-09-08 18:34:46,245 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 18:34:46,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 18:34:46,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2019-09-08 18:34:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-09-08 18:34:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-09-08 18:34:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-09-08 18:34:46,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-09-08 18:34:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-09-08 18:34:46,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-08 18:34:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-09-08 18:34:46,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_lock [2019-09-08 18:34:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_lock [2019-09-08 18:34:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_lock [2019-09-08 18:34:46,260 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_lock [2019-09-08 18:34:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-08 18:34:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-08 18:34:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-08 18:34:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-08 18:34:46,261 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mutex_of_device [2019-09-08 18:34:46,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mutex_of_device [2019-09-08 18:34:46,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-09-08 18:34:46,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mutex_of_device [2019-09-08 18:34:46,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru3_data [2019-09-08 18:34:46,262 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_update_lock_of_abituguru3_data [2019-09-08 18:34:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_update_lock_of_abituguru3_data [2019-09-08 18:34:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru3_data [2019-09-08 18:34:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_update_lock_of_abituguru3_data [2019-09-08 18:34:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_update_lock_of_abituguru3_data [2019-09-08 18:34:46,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_update_lock_of_abituguru3_data [2019-09-08 18:34:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_update_lock_of_abituguru3_data [2019-09-08 18:34:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_update_lock_of_abituguru3_data [2019-09-08 18:34:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 18:34:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 18:34:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 18:34:46,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 18:34:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 18:34:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 18:34:46,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 18:34:48,010 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-08 18:35:47,293 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 18:35:47,294 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 18:35:47,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:35:47 BoogieIcfgContainer [2019-09-08 18:35:47,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 18:35:47,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 18:35:47,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 18:35:47,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 18:35:47,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:34:43" (1/3) ... [2019-09-08 18:35:47,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6405d921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:35:47, skipping insertion in model container [2019-09-08 18:35:47,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:34:45" (2/3) ... [2019-09-08 18:35:47,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6405d921 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:35:47, skipping insertion in model container [2019-09-08 18:35:47,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:35:47" (3/3) ... [2019-09-08 18:35:47,307 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2019-09-08 18:35:47,318 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 18:35:47,332 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 18:35:47,353 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 18:35:47,405 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 18:35:47,406 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 18:35:47,406 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 18:35:47,406 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 18:35:47,406 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 18:35:47,406 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 18:35:47,406 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 18:35:47,406 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 18:35:47,407 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 18:35:47,455 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states. [2019-09-08 18:35:47,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-08 18:35:47,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:35:47,466 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] [2019-09-08 18:35:47,468 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:35:47,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:35:47,473 INFO L82 PathProgramCache]: Analyzing trace with hash -992060968, now seen corresponding path program 1 times [2019-09-08 18:35:47,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:35:47,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:35:47,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:35:47,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:35:47,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:35:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:35:49,548 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 18:35:49,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:35:49,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:35:49,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:35:49,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:35:49,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:35:49,577 INFO L87 Difference]: Start difference. First operand 939 states. Second operand 3 states. [2019-09-08 18:36:01,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:36:01,371 INFO L93 Difference]: Finished difference Result 2010 states and 2703 transitions. [2019-09-08 18:36:01,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:36:01,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-08 18:36:01,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:36:01,434 INFO L225 Difference]: With dead ends: 2010 [2019-09-08 18:36:01,434 INFO L226 Difference]: Without dead ends: 1261 [2019-09-08 18:36:01,449 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 18:36:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-09-08 18:36:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1249. [2019-09-08 18:36:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2019-09-08 18:36:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1651 transitions. [2019-09-08 18:36:01,676 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1651 transitions. Word has length 32 [2019-09-08 18:36:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:36:01,676 INFO L475 AbstractCegarLoop]: Abstraction has 1249 states and 1651 transitions. [2019-09-08 18:36:01,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:36:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1651 transitions. [2019-09-08 18:36:01,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-09-08 18:36:01,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:36:01,698 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] [2019-09-08 18:36:01,699 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:36:01,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:36:01,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1818753620, now seen corresponding path program 1 times [2019-09-08 18:36:01,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:36:01,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:36:01,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:01,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:36:01,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:36:02,981 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 18:36:02,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:36:02,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:36:02,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:36:02,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:36:02,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:36:02,985 INFO L87 Difference]: Start difference. First operand 1249 states and 1651 transitions. Second operand 3 states. [2019-09-08 18:36:21,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:36:21,992 INFO L93 Difference]: Finished difference Result 3457 states and 4597 transitions. [2019-09-08 18:36:21,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:36:21,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-09-08 18:36:21,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:36:22,008 INFO L225 Difference]: With dead ends: 3457 [2019-09-08 18:36:22,009 INFO L226 Difference]: Without dead ends: 2218 [2019-09-08 18:36:22,015 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 18:36:22,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2019-09-08 18:36:22,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2198. [2019-09-08 18:36:22,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-09-08 18:36:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 2931 transitions. [2019-09-08 18:36:22,117 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 2931 transitions. Word has length 37 [2019-09-08 18:36:22,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:36:22,118 INFO L475 AbstractCegarLoop]: Abstraction has 2198 states and 2931 transitions. [2019-09-08 18:36:22,118 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:36:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2931 transitions. [2019-09-08 18:36:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 18:36:22,120 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:36:22,121 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] [2019-09-08 18:36:22,121 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:36:22,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:36:22,121 INFO L82 PathProgramCache]: Analyzing trace with hash 346959247, now seen corresponding path program 1 times [2019-09-08 18:36:22,121 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:36:22,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:36:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:22,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:36:22,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:36:23,263 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 18:36:23,263 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:36:23,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 18:36:23,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 18:36:23,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 18:36:23,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:36:23,265 INFO L87 Difference]: Start difference. First operand 2198 states and 2931 transitions. Second operand 7 states. [2019-09-08 18:36:23,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:36:23,529 INFO L93 Difference]: Finished difference Result 4454 states and 5952 transitions. [2019-09-08 18:36:23,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 18:36:23,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-09-08 18:36:23,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:36:23,551 INFO L225 Difference]: With dead ends: 4454 [2019-09-08 18:36:23,551 INFO L226 Difference]: Without dead ends: 2266 [2019-09-08 18:36:23,568 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 18:36:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-09-08 18:36:23,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2224. [2019-09-08 18:36:23,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2019-09-08 18:36:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 2967 transitions. [2019-09-08 18:36:23,753 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 2967 transitions. Word has length 46 [2019-09-08 18:36:23,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:36:23,754 INFO L475 AbstractCegarLoop]: Abstraction has 2224 states and 2967 transitions. [2019-09-08 18:36:23,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 18:36:23,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 2967 transitions. [2019-09-08 18:36:23,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-08 18:36:23,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:36:23,763 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] [2019-09-08 18:36:23,763 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:36:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:36:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash 487507857, now seen corresponding path program 1 times [2019-09-08 18:36:23,764 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:36:23,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:36:23,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:23,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:36:23,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:24,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:36:24,987 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 18:36:24,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:36:24,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:36:24,989 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:36:24,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:36:24,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:36:24,989 INFO L87 Difference]: Start difference. First operand 2224 states and 2967 transitions. Second operand 3 states. [2019-09-08 18:36:25,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:36:25,058 INFO L93 Difference]: Finished difference Result 2226 states and 2968 transitions. [2019-09-08 18:36:25,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:36:25,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-08 18:36:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:36:25,078 INFO L225 Difference]: With dead ends: 2226 [2019-09-08 18:36:25,078 INFO L226 Difference]: Without dead ends: 2223 [2019-09-08 18:36:25,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 18:36:25,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2019-09-08 18:36:25,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2223. [2019-09-08 18:36:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-09-08 18:36:25,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2965 transitions. [2019-09-08 18:36:25,207 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2965 transitions. Word has length 46 [2019-09-08 18:36:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:36:25,210 INFO L475 AbstractCegarLoop]: Abstraction has 2223 states and 2965 transitions. [2019-09-08 18:36:25,210 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:36:25,210 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2965 transitions. [2019-09-08 18:36:25,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-08 18:36:25,213 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:36:25,213 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] [2019-09-08 18:36:25,213 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:36:25,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:36:25,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2067473578, now seen corresponding path program 1 times [2019-09-08 18:36:25,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:36:25,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:36:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:25,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:36:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:36:27,463 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 18:36:27,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:36:27,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:36:27,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:36:27,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:36:27,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:36:27,465 INFO L87 Difference]: Start difference. First operand 2223 states and 2965 transitions. Second operand 3 states. [2019-09-08 18:36:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:36:27,550 INFO L93 Difference]: Finished difference Result 2225 states and 2966 transitions. [2019-09-08 18:36:27,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:36:27,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-09-08 18:36:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:36:27,565 INFO L225 Difference]: With dead ends: 2225 [2019-09-08 18:36:27,566 INFO L226 Difference]: Without dead ends: 2222 [2019-09-08 18:36:27,567 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 18:36:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2019-09-08 18:36:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2222. [2019-09-08 18:36:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2019-09-08 18:36:27,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2963 transitions. [2019-09-08 18:36:27,678 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2963 transitions. Word has length 47 [2019-09-08 18:36:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:36:27,679 INFO L475 AbstractCegarLoop]: Abstraction has 2222 states and 2963 transitions. [2019-09-08 18:36:27,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:36:27,680 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2963 transitions. [2019-09-08 18:36:27,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 18:36:27,682 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:36:27,682 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 18:36:27,683 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:36:27,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:36:27,683 INFO L82 PathProgramCache]: Analyzing trace with hash 332485428, now seen corresponding path program 1 times [2019-09-08 18:36:27,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:36:27,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:36:27,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:27,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:36:27,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:28,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:36:28,686 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 18:36:28,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:36:28,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:36:28,687 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:36:28,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:36:28,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:36:28,688 INFO L87 Difference]: Start difference. First operand 2222 states and 2963 transitions. Second operand 3 states. [2019-09-08 18:36:28,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:36:28,853 INFO L93 Difference]: Finished difference Result 6164 states and 8261 transitions. [2019-09-08 18:36:28,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:36:28,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-08 18:36:28,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:36:28,881 INFO L225 Difference]: With dead ends: 6164 [2019-09-08 18:36:28,881 INFO L226 Difference]: Without dead ends: 3931 [2019-09-08 18:36:28,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:36:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2019-09-08 18:36:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3922. [2019-09-08 18:36:29,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-09-08 18:36:29,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5259 transitions. [2019-09-08 18:36:29,103 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5259 transitions. Word has length 48 [2019-09-08 18:36:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:36:29,105 INFO L475 AbstractCegarLoop]: Abstraction has 3922 states and 5259 transitions. [2019-09-08 18:36:29,105 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:36:29,105 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5259 transitions. [2019-09-08 18:36:29,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 18:36:29,107 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:36:29,108 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:36:29,108 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:36:29,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:36:29,108 INFO L82 PathProgramCache]: Analyzing trace with hash 675112832, now seen corresponding path program 1 times [2019-09-08 18:36:29,109 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:36:29,109 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:36:29,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:29,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:36:29,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:36:30,021 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 18:36:30,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:36:30,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:36:30,023 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:36:30,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:36:30,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:36:30,024 INFO L87 Difference]: Start difference. First operand 3922 states and 5259 transitions. Second operand 3 states. [2019-09-08 18:36:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:36:51,469 INFO L93 Difference]: Finished difference Result 9648 states and 13023 transitions. [2019-09-08 18:36:51,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:36:51,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 18:36:51,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:36:51,513 INFO L225 Difference]: With dead ends: 9648 [2019-09-08 18:36:51,514 INFO L226 Difference]: Without dead ends: 5736 [2019-09-08 18:36:51,534 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 18:36:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2019-09-08 18:36:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 5710. [2019-09-08 18:36:51,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5710 states. [2019-09-08 18:36:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5710 states to 5710 states and 7665 transitions. [2019-09-08 18:36:51,818 INFO L78 Accepts]: Start accepts. Automaton has 5710 states and 7665 transitions. Word has length 79 [2019-09-08 18:36:51,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:36:51,819 INFO L475 AbstractCegarLoop]: Abstraction has 5710 states and 7665 transitions. [2019-09-08 18:36:51,819 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:36:51,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 7665 transitions. [2019-09-08 18:36:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-09-08 18:36:51,826 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:36:51,826 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:36:51,827 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:36:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:36:51,827 INFO L82 PathProgramCache]: Analyzing trace with hash -676613204, now seen corresponding path program 1 times [2019-09-08 18:36:51,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:36:51,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:36:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:51,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:36:51,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:36:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:36:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 18:36:52,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:36:52,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:36:52,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:36:52,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:36:52,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:36:52,741 INFO L87 Difference]: Start difference. First operand 5710 states and 7665 transitions. Second operand 3 states. [2019-09-08 18:37:14,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:37:14,504 INFO L93 Difference]: Finished difference Result 13224 states and 17835 transitions. [2019-09-08 18:37:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:37:14,505 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-09-08 18:37:14,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:37:14,581 INFO L225 Difference]: With dead ends: 13224 [2019-09-08 18:37:14,581 INFO L226 Difference]: Without dead ends: 7524 [2019-09-08 18:37:14,611 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 18:37:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7524 states. [2019-09-08 18:37:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7524 to 7498. [2019-09-08 18:37:14,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7498 states. [2019-09-08 18:37:14,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7498 states to 7498 states and 10071 transitions. [2019-09-08 18:37:14,959 INFO L78 Accepts]: Start accepts. Automaton has 7498 states and 10071 transitions. Word has length 104 [2019-09-08 18:37:14,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:37:14,960 INFO L475 AbstractCegarLoop]: Abstraction has 7498 states and 10071 transitions. [2019-09-08 18:37:14,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:37:14,960 INFO L276 IsEmpty]: Start isEmpty. Operand 7498 states and 10071 transitions. [2019-09-08 18:37:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 18:37:14,970 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:37:14,970 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:37:14,970 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:37:14,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:37:14,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1151662503, now seen corresponding path program 1 times [2019-09-08 18:37:14,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:37:14,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:37:14,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:37:14,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:37:14,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:37:15,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:37:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 18:37:16,128 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:37:16,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:37:16,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:37:16,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:37:16,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:37:16,129 INFO L87 Difference]: Start difference. First operand 7498 states and 10071 transitions. Second operand 3 states. [2019-09-08 18:37:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:37:35,872 INFO L93 Difference]: Finished difference Result 17137 states and 23038 transitions. [2019-09-08 18:37:35,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:37:35,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-09-08 18:37:35,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:37:35,955 INFO L225 Difference]: With dead ends: 17137 [2019-09-08 18:37:35,955 INFO L226 Difference]: Without dead ends: 9649 [2019-09-08 18:37:35,995 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 18:37:36,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9649 states. [2019-09-08 18:37:36,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9649 to 9558. [2019-09-08 18:37:36,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9558 states. [2019-09-08 18:37:36,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9558 states to 9558 states and 12861 transitions. [2019-09-08 18:37:36,470 INFO L78 Accepts]: Start accepts. Automaton has 9558 states and 12861 transitions. Word has length 127 [2019-09-08 18:37:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:37:36,472 INFO L475 AbstractCegarLoop]: Abstraction has 9558 states and 12861 transitions. [2019-09-08 18:37:36,472 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:37:36,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9558 states and 12861 transitions. [2019-09-08 18:37:36,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 18:37:36,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:37:36,479 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:37:36,479 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:37:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:37:36,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1224842183, now seen corresponding path program 1 times [2019-09-08 18:37:36,480 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:37:36,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:37:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:37:36,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:37:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:37:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:37:37,621 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 18:37:37,622 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:37:37,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:37:37,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:37:37,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:37:37,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:37:37,623 INFO L87 Difference]: Start difference. First operand 9558 states and 12861 transitions. Second operand 3 states. [2019-09-08 18:37:59,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:37:59,984 INFO L93 Difference]: Finished difference Result 21346 states and 28897 transitions. [2019-09-08 18:37:59,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:37:59,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-09-08 18:37:59,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:38:00,032 INFO L225 Difference]: With dead ends: 21346 [2019-09-08 18:38:00,032 INFO L226 Difference]: Without dead ends: 11798 [2019-09-08 18:38:00,068 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 18:38:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11798 states. [2019-09-08 18:38:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11798 to 11772. [2019-09-08 18:38:00,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11772 states. [2019-09-08 18:38:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11772 states to 11772 states and 15853 transitions. [2019-09-08 18:38:00,469 INFO L78 Accepts]: Start accepts. Automaton has 11772 states and 15853 transitions. Word has length 139 [2019-09-08 18:38:00,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:38:00,470 INFO L475 AbstractCegarLoop]: Abstraction has 11772 states and 15853 transitions. [2019-09-08 18:38:00,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:38:00,470 INFO L276 IsEmpty]: Start isEmpty. Operand 11772 states and 15853 transitions. [2019-09-08 18:38:00,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 18:38:00,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:38:00,477 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:38:00,477 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:38:00,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:38:00,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1999485367, now seen corresponding path program 1 times [2019-09-08 18:38:00,478 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:38:00,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:38:00,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:38:00,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:38:00,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:38:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:38:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 18:38:01,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:38:01,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:38:01,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:38:01,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:38:01,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:38:01,412 INFO L87 Difference]: Start difference. First operand 11772 states and 15853 transitions. Second operand 3 states. [2019-09-08 18:38:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:38:20,942 INFO L93 Difference]: Finished difference Result 25774 states and 34881 transitions. [2019-09-08 18:38:20,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:38:20,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-08 18:38:20,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:38:21,003 INFO L225 Difference]: With dead ends: 25774 [2019-09-08 18:38:21,003 INFO L226 Difference]: Without dead ends: 14012 [2019-09-08 18:38:21,037 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 18:38:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14012 states. [2019-09-08 18:38:21,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14012 to 13986. [2019-09-08 18:38:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13986 states. [2019-09-08 18:38:22,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13986 states to 13986 states and 18845 transitions. [2019-09-08 18:38:22,686 INFO L78 Accepts]: Start accepts. Automaton has 13986 states and 18845 transitions. Word has length 140 [2019-09-08 18:38:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:38:22,687 INFO L475 AbstractCegarLoop]: Abstraction has 13986 states and 18845 transitions. [2019-09-08 18:38:22,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:38:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 13986 states and 18845 transitions. [2019-09-08 18:38:22,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 18:38:22,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:38:22,696 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:38:22,696 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:38:22,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:38:22,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1704330842, now seen corresponding path program 1 times [2019-09-08 18:38:22,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:38:22,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:38:22,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:38:22,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:38:22,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:38:23,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:38:23,594 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 18:38:23,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:38:23,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:38:23,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:38:23,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:38:23,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:38:23,597 INFO L87 Difference]: Start difference. First operand 13986 states and 18845 transitions. Second operand 3 states. [2019-09-08 18:38:43,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:38:43,810 INFO L93 Difference]: Finished difference Result 30202 states and 40865 transitions. [2019-09-08 18:38:43,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:38:43,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-09-08 18:38:43,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:38:43,876 INFO L225 Difference]: With dead ends: 30202 [2019-09-08 18:38:43,876 INFO L226 Difference]: Without dead ends: 16226 [2019-09-08 18:38:43,909 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 18:38:43,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16226 states. [2019-09-08 18:38:44,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16226 to 16200. [2019-09-08 18:38:44,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-09-08 18:38:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 21837 transitions. [2019-09-08 18:38:44,383 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 21837 transitions. Word has length 141 [2019-09-08 18:38:44,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:38:44,383 INFO L475 AbstractCegarLoop]: Abstraction has 16200 states and 21837 transitions. [2019-09-08 18:38:44,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:38:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 21837 transitions. [2019-09-08 18:38:44,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 18:38:44,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:38:44,390 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:38:44,390 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:38:44,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:38:44,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1893188618, now seen corresponding path program 1 times [2019-09-08 18:38:44,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:38:44,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:38:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:38:44,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:38:44,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:38:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:38:45,286 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 18:38:45,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:38:45,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 18:38:45,288 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 18:38:45,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 18:38:45,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 18:38:45,295 INFO L87 Difference]: Start difference. First operand 16200 states and 21837 transitions. Second operand 5 states. [2019-09-08 18:39:00,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:39:00,763 INFO L93 Difference]: Finished difference Result 32390 states and 43664 transitions. [2019-09-08 18:39:00,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 18:39:00,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-09-08 18:39:00,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:39:00,828 INFO L225 Difference]: With dead ends: 32390 [2019-09-08 18:39:00,828 INFO L226 Difference]: Without dead ends: 16200 [2019-09-08 18:39:00,865 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 18:39:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16200 states. [2019-09-08 18:39:01,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16200 to 16200. [2019-09-08 18:39:01,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-09-08 18:39:01,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 21833 transitions. [2019-09-08 18:39:01,374 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 21833 transitions. Word has length 142 [2019-09-08 18:39:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:39:01,374 INFO L475 AbstractCegarLoop]: Abstraction has 16200 states and 21833 transitions. [2019-09-08 18:39:01,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 18:39:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 21833 transitions. [2019-09-08 18:39:01,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 18:39:01,385 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:39:01,386 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:39:01,386 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:39:01,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:39:01,386 INFO L82 PathProgramCache]: Analyzing trace with hash -823807323, now seen corresponding path program 1 times [2019-09-08 18:39:01,386 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:39:01,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:39:01,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:39:01,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:39:01,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:39:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:39:02,527 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 18:39:02,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:39:02,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 18:39:02,528 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 18:39:02,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 18:39:02,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 18:39:02,529 INFO L87 Difference]: Start difference. First operand 16200 states and 21833 transitions. Second operand 5 states. [2019-09-08 18:39:17,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:39:17,851 INFO L93 Difference]: Finished difference Result 32390 states and 43656 transitions. [2019-09-08 18:39:17,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 18:39:17,852 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-09-08 18:39:17,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:39:17,916 INFO L225 Difference]: With dead ends: 32390 [2019-09-08 18:39:17,917 INFO L226 Difference]: Without dead ends: 16200 [2019-09-08 18:39:17,953 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 18:39:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16200 states. [2019-09-08 18:39:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16200 to 16200. [2019-09-08 18:39:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-09-08 18:39:18,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 21829 transitions. [2019-09-08 18:39:18,480 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 21829 transitions. Word has length 142 [2019-09-08 18:39:18,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:39:18,481 INFO L475 AbstractCegarLoop]: Abstraction has 16200 states and 21829 transitions. [2019-09-08 18:39:18,481 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 18:39:18,481 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 21829 transitions. [2019-09-08 18:39:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 18:39:18,494 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:39:18,495 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 18:39:18,495 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:39:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:39:18,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1083547811, now seen corresponding path program 1 times [2019-09-08 18:39:18,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:39:18,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:39:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:39:18,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:39:18,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:39:18,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:39:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 18:39:19,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:39:19,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 18:39:19,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 18:39:19,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 18:39:19,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 18:39:19,308 INFO L87 Difference]: Start difference. First operand 16200 states and 21829 transitions. Second operand 5 states. [2019-09-08 18:39:35,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:39:35,418 INFO L93 Difference]: Finished difference Result 32390 states and 43648 transitions. [2019-09-08 18:39:35,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 18:39:35,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-09-08 18:39:35,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:39:35,475 INFO L225 Difference]: With dead ends: 32390 [2019-09-08 18:39:35,476 INFO L226 Difference]: Without dead ends: 16200 [2019-09-08 18:39:35,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 18:39:35,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16200 states. [2019-09-08 18:39:35,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16200 to 16200. [2019-09-08 18:39:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-09-08 18:39:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 21825 transitions. [2019-09-08 18:39:36,033 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 21825 transitions. Word has length 141 [2019-09-08 18:39:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:39:36,034 INFO L475 AbstractCegarLoop]: Abstraction has 16200 states and 21825 transitions. [2019-09-08 18:39:36,034 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 18:39:36,034 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 21825 transitions. [2019-09-08 18:39:36,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 18:39:36,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:39:36,041 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:39:36,041 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:39:36,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:39:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash 935552104, now seen corresponding path program 1 times [2019-09-08 18:39:36,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:39:36,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:39:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:39:36,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:39:36,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:39:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:39:37,854 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 18:39:37,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:39:37,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 18:39:37,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 18:39:37,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 18:39:37,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 18:39:37,857 INFO L87 Difference]: Start difference. First operand 16200 states and 21825 transitions. Second operand 5 states. [2019-09-08 18:39:57,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:39:57,349 INFO L93 Difference]: Finished difference Result 32509 states and 43772 transitions. [2019-09-08 18:39:57,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 18:39:57,349 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 146 [2019-09-08 18:39:57,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:39:57,411 INFO L225 Difference]: With dead ends: 32509 [2019-09-08 18:39:57,412 INFO L226 Difference]: Without dead ends: 16263 [2019-09-08 18:39:57,445 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 18:39:57,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16263 states. [2019-09-08 18:39:57,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16263 to 16230. [2019-09-08 18:39:57,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16230 states. [2019-09-08 18:39:57,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16230 states to 16230 states and 21841 transitions. [2019-09-08 18:39:57,983 INFO L78 Accepts]: Start accepts. Automaton has 16230 states and 21841 transitions. Word has length 146 [2019-09-08 18:39:57,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:39:57,984 INFO L475 AbstractCegarLoop]: Abstraction has 16230 states and 21841 transitions. [2019-09-08 18:39:57,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 18:39:57,984 INFO L276 IsEmpty]: Start isEmpty. Operand 16230 states and 21841 transitions. [2019-09-08 18:39:57,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 18:39:57,993 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:39:57,994 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-09-08 18:39:57,994 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:39:57,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:39:57,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1608450910, now seen corresponding path program 1 times [2019-09-08 18:39:57,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:39:57,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:39:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:39:57,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:39:57,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:39:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:39:58,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 18:39:58,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:39:58,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:39:58,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:39:58,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:39:58,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:39:58,851 INFO L87 Difference]: Start difference. First operand 16230 states and 21841 transitions. Second operand 6 states. [2019-09-08 18:40:18,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:40:18,645 INFO L93 Difference]: Finished difference Result 36115 states and 48118 transitions. [2019-09-08 18:40:18,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 18:40:18,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 188 [2019-09-08 18:40:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:40:18,718 INFO L225 Difference]: With dead ends: 36115 [2019-09-08 18:40:18,718 INFO L226 Difference]: Without dead ends: 19587 [2019-09-08 18:40:19,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-08 18:40:19,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19587 states. [2019-09-08 18:40:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19587 to 18863. [2019-09-08 18:40:19,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18863 states. [2019-09-08 18:40:19,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18863 states to 18863 states and 25018 transitions. [2019-09-08 18:40:19,835 INFO L78 Accepts]: Start accepts. Automaton has 18863 states and 25018 transitions. Word has length 188 [2019-09-08 18:40:19,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:40:19,836 INFO L475 AbstractCegarLoop]: Abstraction has 18863 states and 25018 transitions. [2019-09-08 18:40:19,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:40:19,836 INFO L276 IsEmpty]: Start isEmpty. Operand 18863 states and 25018 transitions. [2019-09-08 18:40:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 18:40:19,850 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:40:19,850 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-09-08 18:40:19,851 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:40:19,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:40:19,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1971069537, now seen corresponding path program 1 times [2019-09-08 18:40:19,852 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:40:19,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:40:19,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:40:19,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:40:19,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:40:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:40:20,677 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 18:40:20,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:40:20,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 18:40:20,678 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 18:40:20,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 18:40:20,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 18:40:20,679 INFO L87 Difference]: Start difference. First operand 18863 states and 25018 transitions. Second operand 5 states. [2019-09-08 18:40:36,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:40:36,453 INFO L93 Difference]: Finished difference Result 28233 states and 37444 transitions. [2019-09-08 18:40:36,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 18:40:36,453 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 210 [2019-09-08 18:40:36,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:40:36,480 INFO L225 Difference]: With dead ends: 28233 [2019-09-08 18:40:36,480 INFO L226 Difference]: Without dead ends: 9395 [2019-09-08 18:40:36,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 18:40:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9395 states. [2019-09-08 18:40:36,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9395 to 6916. [2019-09-08 18:40:36,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6916 states. [2019-09-08 18:40:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6916 states to 6916 states and 9429 transitions. [2019-09-08 18:40:36,778 INFO L78 Accepts]: Start accepts. Automaton has 6916 states and 9429 transitions. Word has length 210 [2019-09-08 18:40:36,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:40:36,779 INFO L475 AbstractCegarLoop]: Abstraction has 6916 states and 9429 transitions. [2019-09-08 18:40:36,779 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 18:40:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 6916 states and 9429 transitions. [2019-09-08 18:40:36,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 18:40:36,785 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:40:36,785 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:40:36,786 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:40:36,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:40:36,786 INFO L82 PathProgramCache]: Analyzing trace with hash -673068956, now seen corresponding path program 1 times [2019-09-08 18:40:36,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:40:36,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:40:36,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:40:36,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:40:36,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:40:37,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:40:38,127 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 18:40:38,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:40:38,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 18:40:38,129 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 18:40:38,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 18:40:38,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:40:38,130 INFO L87 Difference]: Start difference. First operand 6916 states and 9429 transitions. Second operand 7 states. [2019-09-08 18:40:38,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:40:38,382 INFO L93 Difference]: Finished difference Result 13901 states and 18958 transitions. [2019-09-08 18:40:38,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 18:40:38,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 197 [2019-09-08 18:40:38,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:40:38,396 INFO L225 Difference]: With dead ends: 13901 [2019-09-08 18:40:38,397 INFO L226 Difference]: Without dead ends: 7004 [2019-09-08 18:40:38,406 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 18:40:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7004 states. [2019-09-08 18:40:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7004 to 6924. [2019-09-08 18:40:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6924 states. [2019-09-08 18:40:38,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6924 states to 6924 states and 9431 transitions. [2019-09-08 18:40:38,808 INFO L78 Accepts]: Start accepts. Automaton has 6924 states and 9431 transitions. Word has length 197 [2019-09-08 18:40:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:40:38,808 INFO L475 AbstractCegarLoop]: Abstraction has 6924 states and 9431 transitions. [2019-09-08 18:40:38,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 18:40:38,809 INFO L276 IsEmpty]: Start isEmpty. Operand 6924 states and 9431 transitions. [2019-09-08 18:40:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 18:40:38,815 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:40:38,815 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:40:38,816 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:40:38,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:40:38,816 INFO L82 PathProgramCache]: Analyzing trace with hash 906967291, now seen corresponding path program 1 times [2019-09-08 18:40:38,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:40:38,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:40:38,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:40:38,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:40:38,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:40:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:40:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 18:40:40,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 18:40:40,435 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 18:40:40,475 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 18:40:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 18:40:59,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 18:40:59,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-09-08 18:40:59,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 18:40:59,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 18:40:59,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 18:40:59,435 INFO L87 Difference]: Start difference. First operand 6924 states and 9431 transitions. Second operand 4 states. [2019-09-08 18:41:21,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:41:21,076 INFO L93 Difference]: Finished difference Result 14716 states and 20009 transitions. [2019-09-08 18:41:21,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 18:41:21,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 224 [2019-09-08 18:41:21,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:41:21,112 INFO L225 Difference]: With dead ends: 14716 [2019-09-08 18:41:21,112 INFO L226 Difference]: Without dead ends: 14692 [2019-09-08 18:41:21,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 18:41:21,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14692 states. [2019-09-08 18:41:21,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14692 to 14639. [2019-09-08 18:41:21,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14639 states. [2019-09-08 18:41:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14639 states to 14639 states and 19921 transitions. [2019-09-08 18:41:21,690 INFO L78 Accepts]: Start accepts. Automaton has 14639 states and 19921 transitions. Word has length 224 [2019-09-08 18:41:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:41:21,691 INFO L475 AbstractCegarLoop]: Abstraction has 14639 states and 19921 transitions. [2019-09-08 18:41:21,692 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 18:41:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 14639 states and 19921 transitions. [2019-09-08 18:41:21,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 18:41:21,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:41:21,708 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:41:21,709 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:41:21,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:41:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1812696710, now seen corresponding path program 1 times [2019-09-08 18:41:21,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:41:21,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:41:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:41:21,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:41:21,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:41:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:41:22,612 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-09-08 18:41:22,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 18:41:22,613 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 18:41:22,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:41:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 18:41:40,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 18:41:40,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-08 18:41:40,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:41:40,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:41:40,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:41:40,969 INFO L87 Difference]: Start difference. First operand 14639 states and 19921 transitions. Second operand 6 states. [2019-09-08 18:42:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:42:04,936 INFO L93 Difference]: Finished difference Result 28383 states and 38767 transitions. [2019-09-08 18:42:04,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:42:04,936 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 234 [2019-09-08 18:42:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:42:04,969 INFO L225 Difference]: With dead ends: 28383 [2019-09-08 18:42:04,969 INFO L226 Difference]: Without dead ends: 13704 [2019-09-08 18:42:04,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:42:04,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13704 states. [2019-09-08 18:42:05,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13704 to 13583. [2019-09-08 18:42:05,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13583 states. [2019-09-08 18:42:05,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13583 states to 13583 states and 18522 transitions. [2019-09-08 18:42:05,488 INFO L78 Accepts]: Start accepts. Automaton has 13583 states and 18522 transitions. Word has length 234 [2019-09-08 18:42:05,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:42:05,489 INFO L475 AbstractCegarLoop]: Abstraction has 13583 states and 18522 transitions. [2019-09-08 18:42:05,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:42:05,489 INFO L276 IsEmpty]: Start isEmpty. Operand 13583 states and 18522 transitions. [2019-09-08 18:42:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-08 18:42:05,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:42:05,499 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:42:05,499 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:42:05,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:42:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash -740993298, now seen corresponding path program 1 times [2019-09-08 18:42:05,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:42:05,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:42:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:42:05,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:42:05,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:42:05,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:42:06,364 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-09-08 18:42:06,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:42:06,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:42:06,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:42:06,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:42:06,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:42:06,366 INFO L87 Difference]: Start difference. First operand 13583 states and 18522 transitions. Second operand 3 states. [2019-09-08 18:42:26,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:42:26,622 INFO L93 Difference]: Finished difference Result 28148 states and 38593 transitions. [2019-09-08 18:42:26,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:42:26,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-08 18:42:26,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:42:26,654 INFO L225 Difference]: With dead ends: 28148 [2019-09-08 18:42:26,654 INFO L226 Difference]: Without dead ends: 15355 [2019-09-08 18:42:26,675 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 18:42:26,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15355 states. [2019-09-08 18:42:27,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15355 to 15329. [2019-09-08 18:42:27,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15329 states. [2019-09-08 18:42:27,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15329 states to 15329 states and 20916 transitions. [2019-09-08 18:42:27,067 INFO L78 Accepts]: Start accepts. Automaton has 15329 states and 20916 transitions. Word has length 238 [2019-09-08 18:42:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:42:27,068 INFO L475 AbstractCegarLoop]: Abstraction has 15329 states and 20916 transitions. [2019-09-08 18:42:27,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:42:27,069 INFO L276 IsEmpty]: Start isEmpty. Operand 15329 states and 20916 transitions. [2019-09-08 18:42:27,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 18:42:27,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:42:27,079 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:42:27,079 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:42:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:42:27,079 INFO L82 PathProgramCache]: Analyzing trace with hash -497840700, now seen corresponding path program 1 times [2019-09-08 18:42:27,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:42:27,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:42:27,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:42:27,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:42:27,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:42:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:42:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 18:42:28,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:42:28,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:42:28,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:42:28,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:42:28,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:42:28,312 INFO L87 Difference]: Start difference. First operand 15329 states and 20916 transitions. Second operand 3 states. [2019-09-08 18:42:28,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:42:28,788 INFO L93 Difference]: Finished difference Result 30491 states and 41725 transitions. [2019-09-08 18:42:28,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:42:28,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-09-08 18:42:28,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:42:28,821 INFO L225 Difference]: With dead ends: 30491 [2019-09-08 18:42:28,821 INFO L226 Difference]: Without dead ends: 15346 [2019-09-08 18:42:28,842 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 18:42:28,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15346 states. [2019-09-08 18:42:29,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15346 to 15346. [2019-09-08 18:42:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15346 states. [2019-09-08 18:42:29,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15346 states to 15346 states and 20933 transitions. [2019-09-08 18:42:29,173 INFO L78 Accepts]: Start accepts. Automaton has 15346 states and 20933 transitions. Word has length 252 [2019-09-08 18:42:29,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:42:29,174 INFO L475 AbstractCegarLoop]: Abstraction has 15346 states and 20933 transitions. [2019-09-08 18:42:29,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:42:29,174 INFO L276 IsEmpty]: Start isEmpty. Operand 15346 states and 20933 transitions. [2019-09-08 18:42:29,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 18:42:29,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:42:29,182 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:42:29,182 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:42:29,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:42:29,183 INFO L82 PathProgramCache]: Analyzing trace with hash 213854792, now seen corresponding path program 1 times [2019-09-08 18:42:29,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:42:29,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:42:29,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:42:29,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:42:29,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:42:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:42:30,015 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 18:42:30,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:42:30,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:42:30,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:42:30,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:42:30,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:42:30,017 INFO L87 Difference]: Start difference. First operand 15346 states and 20933 transitions. Second operand 3 states. [2019-09-08 18:42:50,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:42:50,948 INFO L93 Difference]: Finished difference Result 29903 states and 40831 transitions. [2019-09-08 18:42:50,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:42:50,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-09-08 18:42:50,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:42:50,989 INFO L225 Difference]: With dead ends: 29903 [2019-09-08 18:42:50,989 INFO L226 Difference]: Without dead ends: 14562 [2019-09-08 18:42:51,031 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 18:42:51,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14562 states. [2019-09-08 18:42:51,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14562 to 14443. [2019-09-08 18:42:51,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14443 states. [2019-09-08 18:42:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14443 states to 14443 states and 19649 transitions. [2019-09-08 18:42:51,492 INFO L78 Accepts]: Start accepts. Automaton has 14443 states and 19649 transitions. Word has length 252 [2019-09-08 18:42:51,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:42:51,493 INFO L475 AbstractCegarLoop]: Abstraction has 14443 states and 19649 transitions. [2019-09-08 18:42:51,493 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:42:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 14443 states and 19649 transitions. [2019-09-08 18:42:51,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 18:42:51,501 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:42:51,502 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:42:51,502 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:42:51,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:42:51,502 INFO L82 PathProgramCache]: Analyzing trace with hash -843171422, now seen corresponding path program 1 times [2019-09-08 18:42:51,502 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:42:51,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:42:51,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:42:51,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:42:51,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:42:51,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:42:52,158 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 18:42:52,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:42:52,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:42:52,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:42:52,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:42:52,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:42:52,160 INFO L87 Difference]: Start difference. First operand 14443 states and 19649 transitions. Second operand 3 states. [2019-09-08 18:43:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:43:12,645 INFO L93 Difference]: Finished difference Result 29862 states and 40828 transitions. [2019-09-08 18:43:12,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:43:12,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-08 18:43:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:43:12,683 INFO L225 Difference]: With dead ends: 29862 [2019-09-08 18:43:12,684 INFO L226 Difference]: Without dead ends: 16210 [2019-09-08 18:43:12,705 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 18:43:12,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16210 states. [2019-09-08 18:43:13,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16210 to 16179. [2019-09-08 18:43:13,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16179 states. [2019-09-08 18:43:13,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16179 states to 16179 states and 22021 transitions. [2019-09-08 18:43:13,088 INFO L78 Accepts]: Start accepts. Automaton has 16179 states and 22021 transitions. Word has length 245 [2019-09-08 18:43:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:43:13,089 INFO L475 AbstractCegarLoop]: Abstraction has 16179 states and 22021 transitions. [2019-09-08 18:43:13,089 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:43:13,089 INFO L276 IsEmpty]: Start isEmpty. Operand 16179 states and 22021 transitions. [2019-09-08 18:43:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 18:43:13,098 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:43:13,098 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:43:13,098 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:43:13,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:43:13,099 INFO L82 PathProgramCache]: Analyzing trace with hash 5473420, now seen corresponding path program 1 times [2019-09-08 18:43:13,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:43:13,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:43:13,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:43:13,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:43:13,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:43:13,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:43:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-09-08 18:43:13,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:43:13,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:43:13,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:43:13,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:43:13,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:43:13,678 INFO L87 Difference]: Start difference. First operand 16179 states and 22021 transitions. Second operand 3 states. [2019-09-08 18:43:33,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:43:33,656 INFO L93 Difference]: Finished difference Result 33334 states and 45572 transitions. [2019-09-08 18:43:33,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:43:33,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-08 18:43:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:43:33,697 INFO L225 Difference]: With dead ends: 33334 [2019-09-08 18:43:33,697 INFO L226 Difference]: Without dead ends: 17946 [2019-09-08 18:43:33,719 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 18:43:33,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17946 states. [2019-09-08 18:43:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17946 to 17915. [2019-09-08 18:43:34,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17915 states. [2019-09-08 18:43:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17915 states to 17915 states and 24393 transitions. [2019-09-08 18:43:34,084 INFO L78 Accepts]: Start accepts. Automaton has 17915 states and 24393 transitions. Word has length 246 [2019-09-08 18:43:34,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:43:34,084 INFO L475 AbstractCegarLoop]: Abstraction has 17915 states and 24393 transitions. [2019-09-08 18:43:34,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:43:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 17915 states and 24393 transitions. [2019-09-08 18:43:34,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-09-08 18:43:34,092 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:43:34,092 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:43:34,092 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:43:34,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:43:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash -609597769, now seen corresponding path program 1 times [2019-09-08 18:43:34,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:43:34,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:43:34,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:43:34,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:43:34,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:43:34,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:43:35,072 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 18:43:35,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:43:35,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:43:35,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:43:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:43:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:43:35,074 INFO L87 Difference]: Start difference. First operand 17915 states and 24393 transitions. Second operand 3 states. [2019-09-08 18:43:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:43:55,211 INFO L93 Difference]: Finished difference Result 36806 states and 50316 transitions. [2019-09-08 18:43:55,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:43:55,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-09-08 18:43:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:43:55,257 INFO L225 Difference]: With dead ends: 36806 [2019-09-08 18:43:55,258 INFO L226 Difference]: Without dead ends: 19682 [2019-09-08 18:43:55,284 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 18:43:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19682 states. [2019-09-08 18:43:55,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19682 to 19651. [2019-09-08 18:43:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19651 states. [2019-09-08 18:43:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19651 states to 19651 states and 26765 transitions. [2019-09-08 18:43:55,689 INFO L78 Accepts]: Start accepts. Automaton has 19651 states and 26765 transitions. Word has length 246 [2019-09-08 18:43:55,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:43:55,690 INFO L475 AbstractCegarLoop]: Abstraction has 19651 states and 26765 transitions. [2019-09-08 18:43:55,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:43:55,690 INFO L276 IsEmpty]: Start isEmpty. Operand 19651 states and 26765 transitions. [2019-09-08 18:43:55,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-09-08 18:43:55,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:43:55,701 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:43:55,701 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:43:55,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:43:55,701 INFO L82 PathProgramCache]: Analyzing trace with hash -497477452, now seen corresponding path program 1 times [2019-09-08 18:43:55,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:43:55,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:43:55,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:43:55,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:43:55,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:43:55,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:43:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-08 18:43:56,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:43:56,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:43:56,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:43:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:43:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:43:56,387 INFO L87 Difference]: Start difference. First operand 19651 states and 26765 transitions. Second operand 3 states. [2019-09-08 18:44:16,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:44:16,948 INFO L93 Difference]: Finished difference Result 40278 states and 55060 transitions. [2019-09-08 18:44:16,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:44:16,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-09-08 18:44:16,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:44:16,998 INFO L225 Difference]: With dead ends: 40278 [2019-09-08 18:44:16,999 INFO L226 Difference]: Without dead ends: 21418 [2019-09-08 18:44:17,030 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 18:44:17,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21418 states. [2019-09-08 18:44:17,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21418 to 21387. [2019-09-08 18:44:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21387 states. [2019-09-08 18:44:17,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21387 states to 21387 states and 29137 transitions. [2019-09-08 18:44:17,487 INFO L78 Accepts]: Start accepts. Automaton has 21387 states and 29137 transitions. Word has length 247 [2019-09-08 18:44:17,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:44:17,487 INFO L475 AbstractCegarLoop]: Abstraction has 21387 states and 29137 transitions. [2019-09-08 18:44:17,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:44:17,488 INFO L276 IsEmpty]: Start isEmpty. Operand 21387 states and 29137 transitions. [2019-09-08 18:44:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-08 18:44:17,496 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:44:17,496 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:44:17,497 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:44:17,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:44:17,497 INFO L82 PathProgramCache]: Analyzing trace with hash -427308927, now seen corresponding path program 1 times [2019-09-08 18:44:17,497 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:44:17,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:44:17,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:44:17,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:44:17,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:44:17,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:44:18,518 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-08 18:44:18,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:44:18,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:44:18,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:44:18,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:44:18,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:44:18,519 INFO L87 Difference]: Start difference. First operand 21387 states and 29137 transitions. Second operand 3 states. [2019-09-08 18:44:39,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:44:39,839 INFO L93 Difference]: Finished difference Result 43750 states and 59804 transitions. [2019-09-08 18:44:39,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:44:39,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-09-08 18:44:39,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:44:39,891 INFO L225 Difference]: With dead ends: 43750 [2019-09-08 18:44:39,891 INFO L226 Difference]: Without dead ends: 23154 [2019-09-08 18:44:39,922 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 18:44:39,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23154 states. [2019-09-08 18:44:40,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23154 to 23123. [2019-09-08 18:44:40,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23123 states. [2019-09-08 18:44:40,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23123 states to 23123 states and 31509 transitions. [2019-09-08 18:44:40,399 INFO L78 Accepts]: Start accepts. Automaton has 23123 states and 31509 transitions. Word has length 253 [2019-09-08 18:44:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:44:40,399 INFO L475 AbstractCegarLoop]: Abstraction has 23123 states and 31509 transitions. [2019-09-08 18:44:40,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:44:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23123 states and 31509 transitions. [2019-09-08 18:44:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-09-08 18:44:40,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:44:40,407 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:44:40,407 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:44:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:44:40,407 INFO L82 PathProgramCache]: Analyzing trace with hash -963429492, now seen corresponding path program 1 times [2019-09-08 18:44:40,407 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:44:40,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:44:40,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:44:40,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:44:40,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:44:40,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:44:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 18:44:40,959 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:44:40,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:44:40,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:44:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:44:40,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:44:40,960 INFO L87 Difference]: Start difference. First operand 23123 states and 31509 transitions. Second operand 3 states. [2019-09-08 18:45:01,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:45:01,661 INFO L93 Difference]: Finished difference Result 51061 states and 69587 transitions. [2019-09-08 18:45:01,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:45:01,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-09-08 18:45:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:45:01,729 INFO L225 Difference]: With dead ends: 51061 [2019-09-08 18:45:01,730 INFO L226 Difference]: Without dead ends: 28122 [2019-09-08 18:45:01,769 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 18:45:01,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28122 states. [2019-09-08 18:45:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28122 to 28094. [2019-09-08 18:45:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28094 states. [2019-09-08 18:45:02,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28094 states to 28094 states and 38104 transitions. [2019-09-08 18:45:02,819 INFO L78 Accepts]: Start accepts. Automaton has 28094 states and 38104 transitions. Word has length 255 [2019-09-08 18:45:02,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:45:02,820 INFO L475 AbstractCegarLoop]: Abstraction has 28094 states and 38104 transitions. [2019-09-08 18:45:02,820 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:45:02,820 INFO L276 IsEmpty]: Start isEmpty. Operand 28094 states and 38104 transitions. [2019-09-08 18:45:02,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-09-08 18:45:02,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:45:02,828 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:45:02,828 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:45:02,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:45:02,828 INFO L82 PathProgramCache]: Analyzing trace with hash -2061472726, now seen corresponding path program 1 times [2019-09-08 18:45:02,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:45:02,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:45:02,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:45:02,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:45:02,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:45:03,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:45:03,474 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 18:45:03,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 18:45:03,475 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) [2019-09-08 18:45:03,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 18:45:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-09-08 18:45:21,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-09-08 18:45:21,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-09-08 18:45:21,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:45:21,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:45:21,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:45:21,712 INFO L87 Difference]: Start difference. First operand 28094 states and 38104 transitions. Second operand 6 states. [2019-09-08 18:45:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:45:45,185 INFO L93 Difference]: Finished difference Result 73697 states and 99916 transitions. [2019-09-08 18:45:45,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 18:45:45,186 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 256 [2019-09-08 18:45:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:45:45,344 INFO L225 Difference]: With dead ends: 73697 [2019-09-08 18:45:45,344 INFO L226 Difference]: Without dead ends: 45787 [2019-09-08 18:45:45,389 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:45:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45787 states. [2019-09-08 18:45:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45787 to 45605. [2019-09-08 18:45:46,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45605 states. [2019-09-08 18:45:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45605 states to 45605 states and 61786 transitions. [2019-09-08 18:45:46,367 INFO L78 Accepts]: Start accepts. Automaton has 45605 states and 61786 transitions. Word has length 256 [2019-09-08 18:45:46,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:45:46,368 INFO L475 AbstractCegarLoop]: Abstraction has 45605 states and 61786 transitions. [2019-09-08 18:45:46,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:45:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 45605 states and 61786 transitions. [2019-09-08 18:45:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2019-09-08 18:45:46,375 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:45:46,375 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:45:46,376 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:45:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:45:46,376 INFO L82 PathProgramCache]: Analyzing trace with hash 925539847, now seen corresponding path program 1 times [2019-09-08 18:45:46,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:45:46,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:45:46,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:45:46,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:45:46,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:45:46,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:45:46,973 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-09-08 18:45:46,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:45:46,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:45:46,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:45:46,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:45:46,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:45:46,975 INFO L87 Difference]: Start difference. First operand 45605 states and 61786 transitions. Second operand 3 states. [2019-09-08 18:46:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:46:08,697 INFO L93 Difference]: Finished difference Result 94136 states and 127848 transitions. [2019-09-08 18:46:08,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:46:08,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 262 [2019-09-08 18:46:08,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:46:08,852 INFO L225 Difference]: With dead ends: 94136 [2019-09-08 18:46:08,852 INFO L226 Difference]: Without dead ends: 49294 [2019-09-08 18:46:08,911 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 18:46:08,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49294 states. [2019-09-08 18:46:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49294 to 48999. [2019-09-08 18:46:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48999 states. [2019-09-08 18:46:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48999 states to 48999 states and 66332 transitions. [2019-09-08 18:46:09,959 INFO L78 Accepts]: Start accepts. Automaton has 48999 states and 66332 transitions. Word has length 262 [2019-09-08 18:46:09,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:46:09,959 INFO L475 AbstractCegarLoop]: Abstraction has 48999 states and 66332 transitions. [2019-09-08 18:46:09,959 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:46:09,960 INFO L276 IsEmpty]: Start isEmpty. Operand 48999 states and 66332 transitions. [2019-09-08 18:46:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 18:46:09,968 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:46:09,968 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:46:09,968 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:46:09,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:46:09,969 INFO L82 PathProgramCache]: Analyzing trace with hash -689748931, now seen corresponding path program 1 times [2019-09-08 18:46:09,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:46:09,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:46:09,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:46:09,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:46:09,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:46:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:46:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 18:46:10,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:46:10,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:46:10,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:46:10,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:46:10,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:46:10,576 INFO L87 Difference]: Start difference. First operand 48999 states and 66332 transitions. Second operand 3 states. [2019-09-08 18:46:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:46:32,506 INFO L93 Difference]: Finished difference Result 100924 states and 136940 transitions. [2019-09-08 18:46:32,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:46:32,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 269 [2019-09-08 18:46:32,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:46:32,640 INFO L225 Difference]: With dead ends: 100924 [2019-09-08 18:46:32,640 INFO L226 Difference]: Without dead ends: 52688 [2019-09-08 18:46:32,711 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 18:46:32,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52688 states. [2019-09-08 18:46:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52688 to 52393. [2019-09-08 18:46:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52393 states. [2019-09-08 18:46:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52393 states to 52393 states and 70878 transitions. [2019-09-08 18:46:34,552 INFO L78 Accepts]: Start accepts. Automaton has 52393 states and 70878 transitions. Word has length 269 [2019-09-08 18:46:34,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:46:34,553 INFO L475 AbstractCegarLoop]: Abstraction has 52393 states and 70878 transitions. [2019-09-08 18:46:34,553 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:46:34,553 INFO L276 IsEmpty]: Start isEmpty. Operand 52393 states and 70878 transitions. [2019-09-08 18:46:34,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-09-08 18:46:34,565 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:46:34,566 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:46:34,566 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:46:34,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:46:34,566 INFO L82 PathProgramCache]: Analyzing trace with hash 286725828, now seen corresponding path program 1 times [2019-09-08 18:46:34,566 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:46:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:46:34,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:46:34,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:46:34,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:46:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:46:35,317 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 46 proven. 20 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-09-08 18:46:35,317 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 18:46:35,317 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 18:46:35,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:46:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:46:52,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 18194 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 18:46:52,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 18:46:52,194 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-09-08 18:46:52,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 18:46:52,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 18:46:52,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:46:52,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:46:52,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:46:52,367 INFO L87 Difference]: Start difference. First operand 52393 states and 70878 transitions. Second operand 6 states. [2019-09-08 18:47:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:47:17,163 INFO L93 Difference]: Finished difference Result 86970 states and 118251 transitions. [2019-09-08 18:47:17,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 18:47:17,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 269 [2019-09-08 18:47:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:47:17,336 INFO L225 Difference]: With dead ends: 86970 [2019-09-08 18:47:17,336 INFO L226 Difference]: Without dead ends: 35340 [2019-09-08 18:47:17,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-08 18:47:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35340 states. [2019-09-08 18:47:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35340 to 31628. [2019-09-08 18:47:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31628 states. [2019-09-08 18:47:19,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31628 states to 31628 states and 42825 transitions. [2019-09-08 18:47:19,436 INFO L78 Accepts]: Start accepts. Automaton has 31628 states and 42825 transitions. Word has length 269 [2019-09-08 18:47:19,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:47:19,437 INFO L475 AbstractCegarLoop]: Abstraction has 31628 states and 42825 transitions. [2019-09-08 18:47:19,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:47:19,438 INFO L276 IsEmpty]: Start isEmpty. Operand 31628 states and 42825 transitions. [2019-09-08 18:47:19,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 18:47:19,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:47:19,455 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:47:19,456 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:47:19,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:47:19,456 INFO L82 PathProgramCache]: Analyzing trace with hash -867878588, now seen corresponding path program 1 times [2019-09-08 18:47:19,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:47:19,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:47:19,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:47:19,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:47:19,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:47:19,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:47:20,420 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-09-08 18:47:20,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:47:20,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:47:20,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:47:20,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:47:20,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:47:20,425 INFO L87 Difference]: Start difference. First operand 31628 states and 42825 transitions. Second operand 3 states. [2019-09-08 18:47:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:47:42,323 INFO L93 Difference]: Finished difference Result 41738 states and 56494 transitions. [2019-09-08 18:47:42,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:47:42,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-09-08 18:47:42,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:47:42,373 INFO L225 Difference]: With dead ends: 41738 [2019-09-08 18:47:42,373 INFO L226 Difference]: Without dead ends: 16252 [2019-09-08 18:47:42,413 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 18:47:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16252 states. [2019-09-08 18:47:42,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16252 to 15924. [2019-09-08 18:47:42,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15924 states. [2019-09-08 18:47:43,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15924 states to 15924 states and 21422 transitions. [2019-09-08 18:47:43,052 INFO L78 Accepts]: Start accepts. Automaton has 15924 states and 21422 transitions. Word has length 282 [2019-09-08 18:47:43,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:47:43,053 INFO L475 AbstractCegarLoop]: Abstraction has 15924 states and 21422 transitions. [2019-09-08 18:47:43,053 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:47:43,053 INFO L276 IsEmpty]: Start isEmpty. Operand 15924 states and 21422 transitions. [2019-09-08 18:47:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-09-08 18:47:43,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:47:43,067 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:47:43,067 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:47:43,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:47:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash 728734884, now seen corresponding path program 1 times [2019-09-08 18:47:43,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:47:43,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:47:43,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:47:43,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:47:43,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:47:43,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:47:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 18:47:44,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:47:44,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:47:44,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:47:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:47:44,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:47:44,008 INFO L87 Difference]: Start difference. First operand 15924 states and 21422 transitions. Second operand 3 states. [2019-09-08 18:47:44,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:47:44,524 INFO L93 Difference]: Finished difference Result 25871 states and 34845 transitions. [2019-09-08 18:47:44,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:47:44,524 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-09-08 18:47:44,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:47:44,576 INFO L225 Difference]: With dead ends: 25871 [2019-09-08 18:47:44,577 INFO L226 Difference]: Without dead ends: 16089 [2019-09-08 18:47:44,600 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 18:47:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16089 states. [2019-09-08 18:47:45,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16089 to 15957. [2019-09-08 18:47:45,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15957 states. [2019-09-08 18:47:45,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15957 states to 15957 states and 21455 transitions. [2019-09-08 18:47:45,364 INFO L78 Accepts]: Start accepts. Automaton has 15957 states and 21455 transitions. Word has length 283 [2019-09-08 18:47:45,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:47:45,365 INFO L475 AbstractCegarLoop]: Abstraction has 15957 states and 21455 transitions. [2019-09-08 18:47:45,365 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:47:45,365 INFO L276 IsEmpty]: Start isEmpty. Operand 15957 states and 21455 transitions. [2019-09-08 18:47:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 18:47:45,380 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:47:45,380 INFO L399 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:47:45,381 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:47:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:47:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash 584309258, now seen corresponding path program 1 times [2019-09-08 18:47:45,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:47:45,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:47:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:47:45,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:47:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:47:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:47:46,753 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 18:47:46,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:47:46,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 18:47:46,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 18:47:46,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 18:47:46,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 18:47:46,754 INFO L87 Difference]: Start difference. First operand 15957 states and 21455 transitions. Second operand 5 states.