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--abituguru.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 09:01:53,585 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 09:01:53,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 09:01:53,598 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 09:01:53,599 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 09:01:53,600 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 09:01:53,601 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 09:01:53,603 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 09:01:53,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 09:01:53,605 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 09:01:53,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 09:01:53,608 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 09:01:53,608 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 09:01:53,609 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 09:01:53,610 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 09:01:53,611 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 09:01:53,612 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 09:01:53,613 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 09:01:53,614 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 09:01:53,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 09:01:53,618 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 09:01:53,619 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 09:01:53,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 09:01:53,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 09:01:53,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 09:01:53,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 09:01:53,625 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 09:01:53,626 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 09:01:53,626 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 09:01:53,627 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 09:01:53,627 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 09:01:53,628 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 09:01:53,629 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 09:01:53,630 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 09:01:53,631 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 09:01:53,631 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 09:01:53,632 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 09:01:53,632 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 09:01:53,633 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 09:01:53,634 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 09:01:53,634 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 09:01:53,635 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 09:01:53,652 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 09:01:53,654 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 09:01:53,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 09:01:53,656 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 09:01:53,656 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 09:01:53,656 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 09:01:53,656 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 09:01:53,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 09:01:53,657 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 09:01:53,657 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 09:01:53,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 09:01:53,657 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 09:01:53,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 09:01:53,658 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 09:01:53,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 09:01:53,658 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 09:01:53,658 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 09:01:53,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 09:01:53,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 09:01:53,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 09:01:53,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 09:01:53,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 09:01:53,661 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 09:01:53,661 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 09:01:53,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 09:01:53,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 09:01:53,662 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 09:01:53,662 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 09:01:53,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 09:01:53,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 09:01:53,710 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 09:01:53,713 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 09:01:53,715 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 09:01:53,715 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 09:01:53,716 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--abituguru.ko-entry_point.cil.out.i [2019-10-02 09:01:53,776 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55711a449/3760aee30dd845c19917f5b2b78be713/FLAGd18beb5f6 [2019-10-02 09:01:54,591 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 09:01:54,592 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--abituguru.ko-entry_point.cil.out.i [2019-10-02 09:01:54,625 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55711a449/3760aee30dd845c19917f5b2b78be713/FLAGd18beb5f6 [2019-10-02 09:01:54,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/55711a449/3760aee30dd845c19917f5b2b78be713 [2019-10-02 09:01:54,684 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 09:01:54,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 09:01:54,687 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 09:01:54,687 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 09:01:54,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 09:01:54,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:01:54" (1/1) ... [2019-10-02 09:01:54,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24a1bb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:54, skipping insertion in model container [2019-10-02 09:01:54,695 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:01:54" (1/1) ... [2019-10-02 09:01:54,703 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 09:01:54,834 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 09:01:56,387 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 09:01:56,467 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 09:01:56,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 09:01:57,115 INFO L192 MainTranslator]: Completed translation [2019-10-02 09:01:57,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:57 WrapperNode [2019-10-02 09:01:57,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 09:01:57,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 09:01:57,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 09:01:57,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 09:01:57,133 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:57" (1/1) ... [2019-10-02 09:01:57,133 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:57" (1/1) ... [2019-10-02 09:01:57,238 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:57" (1/1) ... [2019-10-02 09:01:57,239 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:57" (1/1) ... [2019-10-02 09:01:57,407 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:57" (1/1) ... [2019-10-02 09:01:57,443 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:57" (1/1) ... [2019-10-02 09:01:57,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:57" (1/1) ... [2019-10-02 09:01:57,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 09:01:57,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 09:01:57,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 09:01:57,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 09:01:57,531 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 09:01:57,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 09:01:57,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 09:01:57,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-10-02 09:01:57,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-10-02 09:01:57,648 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtoul [2019-10-02 09:01:57,648 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2019-10-02 09:01:57,649 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2019-10-02 09:01:57,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 09:01:57,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-02 09:01:57,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-02 09:01:57,652 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-02 09:01:57,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-02 09:01:57,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-02 09:01:57,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-02 09:01:57,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-02 09:01:57,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 09:01:57,656 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2019-10-02 09:01:57,657 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2019-10-02 09:01:57,657 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2019-10-02 09:01:57,658 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kzalloc [2019-10-02 09:01:57,658 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-02 09:01:57,658 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-02 09:01:57,658 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2019-10-02 09:01:57,659 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2019-10-02 09:01:57,659 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_wait [2019-10-02 09:01:57,659 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_ready [2019-10-02 09:01:57,659 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_send_address [2019-10-02 09:01:57,660 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_read [2019-10-02 09:01:57,661 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_write [2019-10-02 09:01:57,661 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_detect_bank1_sensor_type [2019-10-02 09:01:57,661 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_detect_no_bank2_sensors [2019-10-02 09:01:57,661 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_detect_no_pwms [2019-10-02 09:01:57,662 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank1_value [2019-10-02 09:01:57,662 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank1_setting [2019-10-02 09:01:57,662 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank2_value [2019-10-02 09:01:57,662 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank2_setting [2019-10-02 09:01:57,663 INFO L138 BoogieDeclarations]: Found implementation of procedure store_bank1_setting [2019-10-02 09:01:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure store_bank2_setting [2019-10-02 09:01:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank1_alarm [2019-10-02 09:01:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank2_alarm [2019-10-02 09:01:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank1_mask [2019-10-02 09:01:57,664 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank2_mask [2019-10-02 09:01:57,665 INFO L138 BoogieDeclarations]: Found implementation of procedure store_bank1_mask [2019-10-02 09:01:57,665 INFO L138 BoogieDeclarations]: Found implementation of procedure store_bank2_mask [2019-10-02 09:01:57,665 INFO L138 BoogieDeclarations]: Found implementation of procedure show_pwm_setting [2019-10-02 09:01:57,665 INFO L138 BoogieDeclarations]: Found implementation of procedure store_pwm_setting [2019-10-02 09:01:57,666 INFO L138 BoogieDeclarations]: Found implementation of procedure show_pwm_sensor [2019-10-02 09:01:57,666 INFO L138 BoogieDeclarations]: Found implementation of procedure store_pwm_sensor [2019-10-02 09:01:57,667 INFO L138 BoogieDeclarations]: Found implementation of procedure show_pwm_enable [2019-10-02 09:01:57,667 INFO L138 BoogieDeclarations]: Found implementation of procedure store_pwm_enable [2019-10-02 09:01:57,667 INFO L138 BoogieDeclarations]: Found implementation of procedure show_name [2019-10-02 09:01:57,667 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_probe [2019-10-02 09:01:57,668 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_remove [2019-10-02 09:01:57,668 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_update_device [2019-10-02 09:01:57,668 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_suspend [2019-10-02 09:01:57,668 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_resume [2019-10-02 09:01:57,668 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_detect [2019-10-02 09:01:57,669 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_init [2019-10-02 09:01:57,669 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_exit [2019-10-02 09:01:57,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_probe_1 [2019-10-02 09:01:57,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_pm_ops_2 [2019-10-02 09:01:57,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_init_1 [2019-10-02 09:01:57,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 09:01:57,671 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-02 09:01:57,671 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-02 09:01:57,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_5 [2019-10-02 09:01:57,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_6 [2019-10-02 09:01:57,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_7 [2019-10-02 09:01:57,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_8 [2019-10-02 09:01:57,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-02 09:01:57,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_10 [2019-10-02 09:01:57,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-10-02 09:01:57,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_12 [2019-10-02 09:01:57,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_13 [2019-10-02 09:01:57,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_14 [2019-10-02 09:01:57,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_15 [2019-10-02 09:01:57,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_16 [2019-10-02 09:01:57,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_17 [2019-10-02 09:01:57,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_18 [2019-10-02 09:01:57,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_19 [2019-10-02 09:01:57,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_20 [2019-10-02 09:01:57,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_21 [2019-10-02 09:01:57,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_22 [2019-10-02 09:01:57,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_23 [2019-10-02 09:01:57,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_24 [2019-10-02 09:01:57,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_25 [2019-10-02 09:01:57,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_26 [2019-10-02 09:01:57,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_27 [2019-10-02 09:01:57,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___platform_driver_register_28 [2019-10-02 09:01:57,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_29 [2019-10-02 09:01:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_30 [2019-10-02 09:01:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 09:01:57,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2019-10-02 09:01:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-02 09:01:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-02 09:01:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-02 09:01:57,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-02 09:01:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-02 09:01:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-02 09:01:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-02 09:01:57,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-02 09:01:57,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-02 09:01:57,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-02 09:01:57,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-02 09:01:57,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_lock [2019-10-02 09:01:57,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_lock [2019-10-02 09:01:57,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_lock [2019-10-02 09:01:57,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_lock [2019-10-02 09:01:57,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-02 09:01:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-02 09:01:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-02 09:01:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-02 09:01:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-02 09:01:57,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-02 09:01:57,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-02 09:01:57,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mutex_of_device [2019-10-02 09:01:57,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mutex_of_device [2019-10-02 09:01:57,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-10-02 09:01:57,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mutex_of_device [2019-10-02 09:01:57,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru_data [2019-10-02 09:01:57,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_update_lock_of_abituguru_data [2019-10-02 09:01:57,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2019-10-02 09:01:57,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_update_lock_of_abituguru_data [2019-10-02 09:01:57,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru_data [2019-10-02 09:01:57,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_update_lock_of_abituguru_data [2019-10-02 09:01:57,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2019-10-02 09:01:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_update_lock_of_abituguru_data [2019-10-02 09:01:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_update_lock_of_abituguru_data [2019-10-02 09:01:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_update_lock_of_abituguru_data [2019-10-02 09:01:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_update_lock_of_abituguru_data [2019-10-02 09:01:57,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 09:01:57,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2019-10-02 09:01:57,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-10-02 09:01:57,692 INFO L138 BoogieDeclarations]: Found implementation of procedure __platform_driver_register [2019-10-02 09:01:57,692 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2019-10-02 09:01:57,692 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2019-10-02 09:01:57,692 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kmalloc [2019-10-02 09:01:57,693 INFO L138 BoogieDeclarations]: Found implementation of procedure dmi_get_system_info [2019-10-02 09:01:57,693 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2019-10-02 09:01:57,694 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2019-10-02 09:01:57,697 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtoull [2019-10-02 09:01:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_complete_2 [2019-10-02 09:01:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_freeze_late_2 [2019-10-02 09:01:57,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_freeze_noirq_2 [2019-10-02 09:01:57,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 09:01:57,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_poweroff_late_2 [2019-10-02 09:01:57,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_poweroff_noirq_2 [2019-10-02 09:01:57,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_prepare_2 [2019-10-02 09:01:57,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_restore_early_2 [2019-10-02 09:01:57,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_restore_noirq_2 [2019-10-02 09:01:57,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_resume_early_2 [2019-10-02 09:01:57,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_resume_noirq_2 [2019-10-02 09:01:57,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_suspend_late_2 [2019-10-02 09:01:57,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_suspend_noirq_2 [2019-10-02 09:01:57,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_thaw_early_2 [2019-10-02 09:01:57,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_thaw_noirq_2 [2019-10-02 09:01:57,708 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2019-10-02 09:01:57,708 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-02 09:01:57,709 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-02 09:01:57,709 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 09:01:57,709 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2019-10-02 09:01:57,709 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add_resources [2019-10-02 09:01:57,710 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2019-10-02 09:01:57,710 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_put [2019-10-02 09:01:57,710 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2019-10-02 09:01:57,710 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2019-10-02 09:01:57,711 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2019-10-02 09:01:57,711 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 09:01:57,711 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2019-10-02 09:01:57,711 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 09:01:57,712 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 09:01:57,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 09:01:57,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-02 09:01:57,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 09:01:57,713 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 09:01:57,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 09:01:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 09:01:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2019-10-02 09:01:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtoull [2019-10-02 09:01:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtoul [2019-10-02 09:01:57,715 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-10-02 09:01:57,715 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-02 09:01:57,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-02 09:01:57,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-02 09:01:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-10-02 09:01:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2019-10-02 09:01:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 09:01:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-10-02 09:01:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2019-10-02 09:01:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-10-02 09:01:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 09:01:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-02 09:01:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-02 09:01:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2019-10-02 09:01:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-10-02 09:01:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-02 09:01:57,720 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_8 [2019-10-02 09:01:57,721 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 09:01:57,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_6 [2019-10-02 09:01:57,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-02 09:01:57,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-10-02 09:01:57,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_13 [2019-10-02 09:01:57,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_15 [2019-10-02 09:01:57,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_17 [2019-10-02 09:01:57,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_19 [2019-10-02 09:01:57,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_21 [2019-10-02 09:01:57,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_23 [2019-10-02 09:01:57,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_25 [2019-10-02 09:01:57,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_27 [2019-10-02 09:01:57,724 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 09:01:57,724 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 09:01:57,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 09:01:57,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 09:01:57,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 09:01:57,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 09:01:57,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 09:01:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 09:01:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-02 09:01:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-02 09:01:57,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-02 09:01:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-02 09:01:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 09:01:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-02 09:01:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-02 09:01:57,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-02 09:01:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-02 09:01:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-02 09:01:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_5 [2019-10-02 09:01:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_7 [2019-10-02 09:01:57,728 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_10 [2019-10-02 09:01:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_12 [2019-10-02 09:01:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_14 [2019-10-02 09:01:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_16 [2019-10-02 09:01:57,729 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_18 [2019-10-02 09:01:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_20 [2019-10-02 09:01:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_22 [2019-10-02 09:01:57,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_24 [2019-10-02 09:01:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_26 [2019-10-02 09:01:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-02 09:01:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-02 09:01:57,731 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-02 09:01:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-02 09:01:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-02 09:01:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2019-10-02 09:01:57,732 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2019-10-02 09:01:57,733 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2019-10-02 09:01:57,733 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2019-10-02 09:01:57,733 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2019-10-02 09:01:57,733 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2019-10-02 09:01:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_probe_1 [2019-10-02 09:01:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_pm_ops_2 [2019-10-02 09:01:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_init_1 [2019-10-02 09:01:57,734 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2019-10-02 09:01:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2019-10-02 09:01:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2019-10-02 09:01:57,735 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kmalloc [2019-10-02 09:01:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kzalloc [2019-10-02 09:01:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-02 09:01:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-02 09:01:57,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 09:01:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2019-10-02 09:01:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2019-10-02 09:01:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2019-10-02 09:01:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add_resources [2019-10-02 09:01:57,737 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2019-10-02 09:01:57,738 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_put [2019-10-02 09:01:57,739 INFO L130 BoogieDeclarations]: Found specification of procedure __platform_driver_register [2019-10-02 09:01:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___platform_driver_register_28 [2019-10-02 09:01:57,745 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2019-10-02 09:01:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_29 [2019-10-02 09:01:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_30 [2019-10-02 09:01:57,746 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2019-10-02 09:01:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2019-10-02 09:01:57,750 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2019-10-02 09:01:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2019-10-02 09:01:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure dmi_get_system_info [2019-10-02 09:01:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_wait [2019-10-02 09:01:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 09:01:57,753 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_ready [2019-10-02 09:01:57,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 09:01:57,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 09:01:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_send_address [2019-10-02 09:01:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_read [2019-10-02 09:01:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_write [2019-10-02 09:01:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_detect_bank1_sensor_type [2019-10-02 09:01:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_detect_no_bank2_sensors [2019-10-02 09:01:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_detect_no_pwms [2019-10-02 09:01:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_update_device [2019-10-02 09:01:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank1_value [2019-10-02 09:01:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank1_setting [2019-10-02 09:01:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank2_value [2019-10-02 09:01:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank2_setting [2019-10-02 09:01:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure store_bank1_setting [2019-10-02 09:01:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure store_bank2_setting [2019-10-02 09:01:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank1_alarm [2019-10-02 09:01:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank2_alarm [2019-10-02 09:01:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank1_mask [2019-10-02 09:01:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank2_mask [2019-10-02 09:01:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure store_bank1_mask [2019-10-02 09:01:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure store_bank2_mask [2019-10-02 09:01:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure show_pwm_setting [2019-10-02 09:01:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure store_pwm_setting [2019-10-02 09:01:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure show_pwm_sensor [2019-10-02 09:01:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure store_pwm_sensor [2019-10-02 09:01:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure show_pwm_enable [2019-10-02 09:01:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure store_pwm_enable [2019-10-02 09:01:57,759 INFO L130 BoogieDeclarations]: Found specification of procedure show_name [2019-10-02 09:01:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_probe [2019-10-02 09:01:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_remove [2019-10-02 09:01:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_suspend [2019-10-02 09:01:57,760 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_resume [2019-10-02 09:01:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_detect [2019-10-02 09:01:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_init [2019-10-02 09:01:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_exit [2019-10-02 09:01:57,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_suspend_late_2 [2019-10-02 09:01:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_restore_noirq_2 [2019-10-02 09:01:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_freeze_late_2 [2019-10-02 09:01:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_complete_2 [2019-10-02 09:01:57,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 09:01:57,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_thaw_early_2 [2019-10-02 09:01:57,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_poweroff_noirq_2 [2019-10-02 09:01:57,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_resume_noirq_2 [2019-10-02 09:01:57,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_resume_early_2 [2019-10-02 09:01:57,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_prepare_2 [2019-10-02 09:01:57,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 09:01:57,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_restore_early_2 [2019-10-02 09:01:57,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_suspend_noirq_2 [2019-10-02 09:01:57,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_poweroff_late_2 [2019-10-02 09:01:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_thaw_noirq_2 [2019-10-02 09:01:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_freeze_noirq_2 [2019-10-02 09:01:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-10-02 09:01:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 09:01:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 09:01:57,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2019-10-02 09:01:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-02 09:01:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-02 09:01:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-02 09:01:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-02 09:01:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-02 09:01:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-02 09:01:57,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-02 09:01:57,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_lock [2019-10-02 09:01:57,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_lock [2019-10-02 09:01:57,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_lock [2019-10-02 09:01:57,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_lock [2019-10-02 09:01:57,767 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-02 09:01:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-02 09:01:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-02 09:01:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-02 09:01:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mutex_of_device [2019-10-02 09:01:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mutex_of_device [2019-10-02 09:01:57,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-10-02 09:01:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mutex_of_device [2019-10-02 09:01:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru_data [2019-10-02 09:01:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_update_lock_of_abituguru_data [2019-10-02 09:01:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_update_lock_of_abituguru_data [2019-10-02 09:01:57,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru_data [2019-10-02 09:01:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_update_lock_of_abituguru_data [2019-10-02 09:01:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_update_lock_of_abituguru_data [2019-10-02 09:01:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_update_lock_of_abituguru_data [2019-10-02 09:01:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_update_lock_of_abituguru_data [2019-10-02 09:01:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_update_lock_of_abituguru_data [2019-10-02 09:01:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 09:01:57,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 09:01:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 09:01:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 09:01:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 09:01:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 09:01:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 09:01:57,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 09:01:59,338 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-02 09:02:19,430 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 09:02:19,430 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 09:02:19,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:02:19 BoogieIcfgContainer [2019-10-02 09:02:19,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 09:02:19,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 09:02:19,436 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 09:02:19,440 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 09:02:19,441 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 09:01:54" (1/3) ... [2019-10-02 09:02:19,442 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b546c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:02:19, skipping insertion in model container [2019-10-02 09:02:19,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:01:57" (2/3) ... [2019-10-02 09:02:19,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b546c64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:02:19, skipping insertion in model container [2019-10-02 09:02:19,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:02:19" (3/3) ... [2019-10-02 09:02:19,446 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2019-10-02 09:02:19,461 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 09:02:19,477 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 09:02:19,503 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 09:02:19,559 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 09:02:19,560 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 09:02:19,561 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 09:02:19,561 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 09:02:19,561 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 09:02:19,561 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 09:02:19,561 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 09:02:19,562 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 09:02:19,562 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 09:02:19,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states. [2019-10-02 09:02:19,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-02 09:02:19,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:19,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:02:19,664 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:19,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:19,675 INFO L82 PathProgramCache]: Analyzing trace with hash 646228273, now seen corresponding path program 1 times [2019-10-02 09:02:19,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:19,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:19,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:19,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:20,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 09:02:20,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:20,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:02:20,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:02:20,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:02:20,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:20,865 INFO L87 Difference]: Start difference. First operand 1401 states. Second operand 3 states. [2019-10-02 09:02:22,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:22,191 INFO L93 Difference]: Finished difference Result 2556 states and 3622 transitions. [2019-10-02 09:02:22,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:02:22,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-02 09:02:22,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:22,237 INFO L225 Difference]: With dead ends: 2556 [2019-10-02 09:02:22,237 INFO L226 Difference]: Without dead ends: 1618 [2019-10-02 09:02:22,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:22,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2019-10-02 09:02:22,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1608. [2019-10-02 09:02:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-10-02 09:02:22,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2268 transitions. [2019-10-02 09:02:22,457 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2268 transitions. Word has length 35 [2019-10-02 09:02:22,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:22,458 INFO L475 AbstractCegarLoop]: Abstraction has 1608 states and 2268 transitions. [2019-10-02 09:02:22,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:02:22,458 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2268 transitions. [2019-10-02 09:02:22,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 09:02:22,469 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:22,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:02:22,470 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:22,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:22,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1976498797, now seen corresponding path program 1 times [2019-10-02 09:02:22,470 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:22,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:22,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:22,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:22,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 09:02:22,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:22,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:02:22,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:02:22,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:02:22,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:22,958 INFO L87 Difference]: Start difference. First operand 1608 states and 2268 transitions. Second operand 3 states. [2019-10-02 09:02:26,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:26,127 INFO L93 Difference]: Finished difference Result 4592 states and 6526 transitions. [2019-10-02 09:02:26,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:02:26,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-02 09:02:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:26,152 INFO L225 Difference]: With dead ends: 4592 [2019-10-02 09:02:26,153 INFO L226 Difference]: Without dead ends: 2994 [2019-10-02 09:02:26,163 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:26,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2019-10-02 09:02:26,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2974. [2019-10-02 09:02:26,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-10-02 09:02:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4243 transitions. [2019-10-02 09:02:26,313 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4243 transitions. Word has length 37 [2019-10-02 09:02:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:26,313 INFO L475 AbstractCegarLoop]: Abstraction has 2974 states and 4243 transitions. [2019-10-02 09:02:26,314 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:02:26,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4243 transitions. [2019-10-02 09:02:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-02 09:02:26,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:26,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:02:26,316 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:26,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:26,316 INFO L82 PathProgramCache]: Analyzing trace with hash -430514139, now seen corresponding path program 1 times [2019-10-02 09:02:26,316 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:26,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:26,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:26,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 09:02:26,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:26,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:02:26,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:02:26,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:02:26,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:26,776 INFO L87 Difference]: Start difference. First operand 2974 states and 4243 transitions. Second operand 3 states. [2019-10-02 09:02:26,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:26,885 INFO L93 Difference]: Finished difference Result 2976 states and 4244 transitions. [2019-10-02 09:02:26,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:02:26,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-02 09:02:26,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:26,906 INFO L225 Difference]: With dead ends: 2976 [2019-10-02 09:02:26,906 INFO L226 Difference]: Without dead ends: 2973 [2019-10-02 09:02:26,909 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:26,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2019-10-02 09:02:27,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2973. [2019-10-02 09:02:27,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2973 states. [2019-10-02 09:02:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2973 states to 2973 states and 4241 transitions. [2019-10-02 09:02:27,068 INFO L78 Accepts]: Start accepts. Automaton has 2973 states and 4241 transitions. Word has length 39 [2019-10-02 09:02:27,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:27,068 INFO L475 AbstractCegarLoop]: Abstraction has 2973 states and 4241 transitions. [2019-10-02 09:02:27,072 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:02:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 2973 states and 4241 transitions. [2019-10-02 09:02:27,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-02 09:02:27,075 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:27,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:02:27,075 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:27,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:27,075 INFO L82 PathProgramCache]: Analyzing trace with hash -461515774, now seen corresponding path program 1 times [2019-10-02 09:02:27,075 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:27,076 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:27,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:27,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:27,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:27,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 09:02:27,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:27,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:02:27,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:02:27,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:02:27,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:27,458 INFO L87 Difference]: Start difference. First operand 2973 states and 4241 transitions. Second operand 3 states. [2019-10-02 09:02:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:27,550 INFO L93 Difference]: Finished difference Result 2975 states and 4242 transitions. [2019-10-02 09:02:27,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:02:27,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-02 09:02:27,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:27,572 INFO L225 Difference]: With dead ends: 2975 [2019-10-02 09:02:27,572 INFO L226 Difference]: Without dead ends: 2972 [2019-10-02 09:02:27,574 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2019-10-02 09:02:27,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2972. [2019-10-02 09:02:27,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2972 states. [2019-10-02 09:02:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 4239 transitions. [2019-10-02 09:02:27,747 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 4239 transitions. Word has length 40 [2019-10-02 09:02:27,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:27,749 INFO L475 AbstractCegarLoop]: Abstraction has 2972 states and 4239 transitions. [2019-10-02 09:02:27,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:02:27,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 4239 transitions. [2019-10-02 09:02:27,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 09:02:27,753 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:27,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:02:27,753 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:27,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:27,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1422561592, now seen corresponding path program 1 times [2019-10-02 09:02:27,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:27,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:27,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:27,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:27,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 09:02:28,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:28,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:02:28,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:02:28,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:02:28,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:28,119 INFO L87 Difference]: Start difference. First operand 2972 states and 4239 transitions. Second operand 3 states. [2019-10-02 09:02:28,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:28,432 INFO L93 Difference]: Finished difference Result 8822 states and 12623 transitions. [2019-10-02 09:02:28,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:02:28,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-02 09:02:28,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:28,474 INFO L225 Difference]: With dead ends: 8822 [2019-10-02 09:02:28,474 INFO L226 Difference]: Without dead ends: 5839 [2019-10-02 09:02:28,492 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:28,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5839 states. [2019-10-02 09:02:28,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5839 to 5829. [2019-10-02 09:02:28,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5829 states. [2019-10-02 09:02:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5829 states to 5829 states and 8345 transitions. [2019-10-02 09:02:28,897 INFO L78 Accepts]: Start accepts. Automaton has 5829 states and 8345 transitions. Word has length 41 [2019-10-02 09:02:28,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:28,898 INFO L475 AbstractCegarLoop]: Abstraction has 5829 states and 8345 transitions. [2019-10-02 09:02:28,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:02:28,898 INFO L276 IsEmpty]: Start isEmpty. Operand 5829 states and 8345 transitions. [2019-10-02 09:02:28,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 09:02:28,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:28,902 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:02:28,903 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:28,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:28,903 INFO L82 PathProgramCache]: Analyzing trace with hash -344533075, now seen corresponding path program 1 times [2019-10-02 09:02:28,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:28,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:28,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:28,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 09:02:29,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:29,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:02:29,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:02:29,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:02:29,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:29,244 INFO L87 Difference]: Start difference. First operand 5829 states and 8345 transitions. Second operand 3 states. [2019-10-02 09:02:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:32,813 INFO L93 Difference]: Finished difference Result 14390 states and 20711 transitions. [2019-10-02 09:02:32,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:02:32,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-10-02 09:02:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:32,874 INFO L225 Difference]: With dead ends: 14390 [2019-10-02 09:02:32,874 INFO L226 Difference]: Without dead ends: 8571 [2019-10-02 09:02:32,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:32,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8571 states. [2019-10-02 09:02:33,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8571 to 8547. [2019-10-02 09:02:33,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8547 states. [2019-10-02 09:02:33,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8547 states to 8547 states and 12269 transitions. [2019-10-02 09:02:33,320 INFO L78 Accepts]: Start accepts. Automaton has 8547 states and 12269 transitions. Word has length 92 [2019-10-02 09:02:33,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:33,321 INFO L475 AbstractCegarLoop]: Abstraction has 8547 states and 12269 transitions. [2019-10-02 09:02:33,321 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:02:33,321 INFO L276 IsEmpty]: Start isEmpty. Operand 8547 states and 12269 transitions. [2019-10-02 09:02:33,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 09:02:33,328 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:33,328 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 09:02:33,329 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:33,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:33,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1971985159, now seen corresponding path program 1 times [2019-10-02 09:02:33,329 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:33,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:33,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:33,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:33,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 09:02:33,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:33,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:02:33,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:02:33,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:02:33,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:33,707 INFO L87 Difference]: Start difference. First operand 8547 states and 12269 transitions. Second operand 3 states. [2019-10-02 09:02:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:38,481 INFO L93 Difference]: Finished difference Result 19826 states and 28559 transitions. [2019-10-02 09:02:38,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:02:38,482 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-10-02 09:02:38,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:38,563 INFO L225 Difference]: With dead ends: 19826 [2019-10-02 09:02:38,563 INFO L226 Difference]: Without dead ends: 11289 [2019-10-02 09:02:38,612 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:38,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11289 states. [2019-10-02 09:02:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11289 to 11265. [2019-10-02 09:02:39,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11265 states. [2019-10-02 09:02:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11265 states to 11265 states and 16193 transitions. [2019-10-02 09:02:39,113 INFO L78 Accepts]: Start accepts. Automaton has 11265 states and 16193 transitions. Word has length 116 [2019-10-02 09:02:39,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:39,114 INFO L475 AbstractCegarLoop]: Abstraction has 11265 states and 16193 transitions. [2019-10-02 09:02:39,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:02:39,114 INFO L276 IsEmpty]: Start isEmpty. Operand 11265 states and 16193 transitions. [2019-10-02 09:02:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 09:02:39,128 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:39,128 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:02:39,129 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash 767036158, now seen corresponding path program 1 times [2019-10-02 09:02:39,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:39,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:39,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:39,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:39,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 09:02:39,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:39,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:02:39,530 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:02:39,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:02:39,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:02:39,532 INFO L87 Difference]: Start difference. First operand 11265 states and 16193 transitions. Second operand 5 states. [2019-10-02 09:02:41,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:41,101 INFO L93 Difference]: Finished difference Result 22520 states and 32376 transitions. [2019-10-02 09:02:41,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:02:41,102 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-02 09:02:41,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:41,161 INFO L225 Difference]: With dead ends: 22520 [2019-10-02 09:02:41,162 INFO L226 Difference]: Without dead ends: 11265 [2019-10-02 09:02:41,211 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:02:41,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11265 states. [2019-10-02 09:02:41,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11265 to 11265. [2019-10-02 09:02:41,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11265 states. [2019-10-02 09:02:41,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11265 states to 11265 states and 16191 transitions. [2019-10-02 09:02:41,645 INFO L78 Accepts]: Start accepts. Automaton has 11265 states and 16191 transitions. Word has length 136 [2019-10-02 09:02:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:41,645 INFO L475 AbstractCegarLoop]: Abstraction has 11265 states and 16191 transitions. [2019-10-02 09:02:41,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:02:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 11265 states and 16191 transitions. [2019-10-02 09:02:41,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 09:02:41,848 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:41,848 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:02:41,849 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:41,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:41,849 INFO L82 PathProgramCache]: Analyzing trace with hash -48459582, now seen corresponding path program 1 times [2019-10-02 09:02:41,849 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:41,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:41,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:41,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:41,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:42,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 09:02:42,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:42,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:02:42,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:02:42,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:02:42,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:42,234 INFO L87 Difference]: Start difference. First operand 11265 states and 16191 transitions. Second operand 3 states. [2019-10-02 09:02:46,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:46,145 INFO L93 Difference]: Finished difference Result 25262 states and 36403 transitions. [2019-10-02 09:02:46,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:02:46,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-10-02 09:02:46,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:46,205 INFO L225 Difference]: With dead ends: 25262 [2019-10-02 09:02:46,205 INFO L226 Difference]: Without dead ends: 14007 [2019-10-02 09:02:46,232 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:46,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14007 states. [2019-10-02 09:02:46,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14007 to 13983. [2019-10-02 09:02:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13983 states. [2019-10-02 09:02:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13983 states to 13983 states and 20115 transitions. [2019-10-02 09:02:46,741 INFO L78 Accepts]: Start accepts. Automaton has 13983 states and 20115 transitions. Word has length 135 [2019-10-02 09:02:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:46,741 INFO L475 AbstractCegarLoop]: Abstraction has 13983 states and 20115 transitions. [2019-10-02 09:02:46,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:02:46,742 INFO L276 IsEmpty]: Start isEmpty. Operand 13983 states and 20115 transitions. [2019-10-02 09:02:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 09:02:46,750 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:46,750 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:02:46,750 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:46,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash 92089028, now seen corresponding path program 1 times [2019-10-02 09:02:46,751 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:46,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:46,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:46,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:46,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:47,090 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 09:02:47,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:47,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:02:47,091 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:02:47,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:02:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:02:47,092 INFO L87 Difference]: Start difference. First operand 13983 states and 20115 transitions. Second operand 5 states. [2019-10-02 09:02:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:48,856 INFO L93 Difference]: Finished difference Result 27956 states and 40220 transitions. [2019-10-02 09:02:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:02:48,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-02 09:02:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:48,916 INFO L225 Difference]: With dead ends: 27956 [2019-10-02 09:02:48,916 INFO L226 Difference]: Without dead ends: 13983 [2019-10-02 09:02:48,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:02:48,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13983 states. [2019-10-02 09:02:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13983 to 13983. [2019-10-02 09:02:49,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13983 states. [2019-10-02 09:02:49,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13983 states to 13983 states and 20113 transitions. [2019-10-02 09:02:49,423 INFO L78 Accepts]: Start accepts. Automaton has 13983 states and 20113 transitions. Word has length 135 [2019-10-02 09:02:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:49,424 INFO L475 AbstractCegarLoop]: Abstraction has 13983 states and 20113 transitions. [2019-10-02 09:02:49,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:02:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 13983 states and 20113 transitions. [2019-10-02 09:02:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 09:02:49,433 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:49,433 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:02:49,433 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:49,434 INFO L82 PathProgramCache]: Analyzing trace with hash 626487548, now seen corresponding path program 1 times [2019-10-02 09:02:49,434 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:49,434 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:49,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:49,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:49,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 09:02:49,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:49,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:02:49,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:02:49,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:02:49,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:49,824 INFO L87 Difference]: Start difference. First operand 13983 states and 20113 transitions. Second operand 3 states. [2019-10-02 09:02:53,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:53,650 INFO L93 Difference]: Finished difference Result 30698 states and 44247 transitions. [2019-10-02 09:02:53,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:02:53,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-10-02 09:02:53,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:53,718 INFO L225 Difference]: With dead ends: 30698 [2019-10-02 09:02:53,718 INFO L226 Difference]: Without dead ends: 16725 [2019-10-02 09:02:53,752 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:53,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16725 states. [2019-10-02 09:02:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16725 to 16701. [2019-10-02 09:02:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16701 states. [2019-10-02 09:02:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16701 states to 16701 states and 24037 transitions. [2019-10-02 09:02:54,526 INFO L78 Accepts]: Start accepts. Automaton has 16701 states and 24037 transitions. Word has length 136 [2019-10-02 09:02:54,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:02:54,527 INFO L475 AbstractCegarLoop]: Abstraction has 16701 states and 24037 transitions. [2019-10-02 09:02:54,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:02:54,527 INFO L276 IsEmpty]: Start isEmpty. Operand 16701 states and 24037 transitions. [2019-10-02 09:02:54,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 09:02:54,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:02:54,536 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 09:02:54,536 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:02:54,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:02:54,537 INFO L82 PathProgramCache]: Analyzing trace with hash 900932714, now seen corresponding path program 1 times [2019-10-02 09:02:54,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:02:54,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:02:54,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:54,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:02:54,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:02:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:02:54,840 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 09:02:54,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:02:54,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:02:54,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:02:54,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:02:54,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:54,842 INFO L87 Difference]: Start difference. First operand 16701 states and 24037 transitions. Second operand 3 states. [2019-10-02 09:02:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:02:58,549 INFO L93 Difference]: Finished difference Result 36134 states and 52095 transitions. [2019-10-02 09:02:58,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:02:58,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-10-02 09:02:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:02:58,630 INFO L225 Difference]: With dead ends: 36134 [2019-10-02 09:02:58,630 INFO L226 Difference]: Without dead ends: 19443 [2019-10-02 09:02:58,677 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:02:58,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19443 states. [2019-10-02 09:03:00,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19443 to 19419. [2019-10-02 09:03:00,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19419 states. [2019-10-02 09:03:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19419 states to 19419 states and 27961 transitions. [2019-10-02 09:03:00,433 INFO L78 Accepts]: Start accepts. Automaton has 19419 states and 27961 transitions. Word has length 133 [2019-10-02 09:03:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:03:00,433 INFO L475 AbstractCegarLoop]: Abstraction has 19419 states and 27961 transitions. [2019-10-02 09:03:00,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:03:00,434 INFO L276 IsEmpty]: Start isEmpty. Operand 19419 states and 27961 transitions. [2019-10-02 09:03:00,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 09:03:00,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:03:00,446 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 09:03:00,447 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:03:00,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:03:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash 766919208, now seen corresponding path program 1 times [2019-10-02 09:03:00,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:03:00,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:03:00,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:00,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:00,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:00,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:00,779 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 09:03:00,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:03:00,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:03:00,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:03:00,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:03:00,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:03:00,786 INFO L87 Difference]: Start difference. First operand 19419 states and 27961 transitions. Second operand 5 states. [2019-10-02 09:03:02,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:03:02,310 INFO L93 Difference]: Finished difference Result 38828 states and 55912 transitions. [2019-10-02 09:03:02,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:03:02,311 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-02 09:03:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:03:02,389 INFO L225 Difference]: With dead ends: 38828 [2019-10-02 09:03:02,389 INFO L226 Difference]: Without dead ends: 19419 [2019-10-02 09:03:02,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:03:02,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19419 states. [2019-10-02 09:03:03,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19419 to 19419. [2019-10-02 09:03:03,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19419 states. [2019-10-02 09:03:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19419 states to 19419 states and 27959 transitions. [2019-10-02 09:03:03,260 INFO L78 Accepts]: Start accepts. Automaton has 19419 states and 27959 transitions. Word has length 133 [2019-10-02 09:03:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:03:03,261 INFO L475 AbstractCegarLoop]: Abstraction has 19419 states and 27959 transitions. [2019-10-02 09:03:03,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:03:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 19419 states and 27959 transitions. [2019-10-02 09:03:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 09:03:03,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:03:03,270 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:03:03,270 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:03:03,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:03:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash 708217995, now seen corresponding path program 1 times [2019-10-02 09:03:03,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:03:03,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:03:03,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:03,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:03,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:03,798 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 09:03:03,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:03:03,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:03:03,799 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:03:03,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:03:03,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:03:03,801 INFO L87 Difference]: Start difference. First operand 19419 states and 27959 transitions. Second operand 5 states. [2019-10-02 09:03:07,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:03:07,291 INFO L93 Difference]: Finished difference Result 38891 states and 55977 transitions. [2019-10-02 09:03:07,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:03:07,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-02 09:03:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:03:07,396 INFO L225 Difference]: With dead ends: 38891 [2019-10-02 09:03:07,397 INFO L226 Difference]: Without dead ends: 19454 [2019-10-02 09:03:07,445 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:03:07,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19454 states. [2019-10-02 09:03:08,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19454 to 19435. [2019-10-02 09:03:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19435 states. [2019-10-02 09:03:08,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19435 states to 19435 states and 27961 transitions. [2019-10-02 09:03:08,279 INFO L78 Accepts]: Start accepts. Automaton has 19435 states and 27961 transitions. Word has length 141 [2019-10-02 09:03:08,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:03:08,280 INFO L475 AbstractCegarLoop]: Abstraction has 19435 states and 27961 transitions. [2019-10-02 09:03:08,280 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:03:08,280 INFO L276 IsEmpty]: Start isEmpty. Operand 19435 states and 27961 transitions. [2019-10-02 09:03:08,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 09:03:08,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:03:08,288 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:03:08,289 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:03:08,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:03:08,289 INFO L82 PathProgramCache]: Analyzing trace with hash -782251796, now seen corresponding path program 1 times [2019-10-02 09:03:08,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:03:08,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:03:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:08,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:08,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:08,771 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 09:03:08,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:03:08,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 09:03:08,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 09:03:08,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 09:03:08,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 09:03:08,773 INFO L87 Difference]: Start difference. First operand 19435 states and 27961 transitions. Second operand 8 states. [2019-10-02 09:03:12,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:03:12,428 INFO L93 Difference]: Finished difference Result 39154 states and 56374 transitions. [2019-10-02 09:03:12,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:03:12,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 183 [2019-10-02 09:03:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:03:12,500 INFO L225 Difference]: With dead ends: 39154 [2019-10-02 09:03:12,500 INFO L226 Difference]: Without dead ends: 19729 [2019-10-02 09:03:12,551 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 09:03:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19729 states. [2019-10-02 09:03:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19729 to 19491. [2019-10-02 09:03:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19491 states. [2019-10-02 09:03:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19491 states to 19491 states and 28017 transitions. [2019-10-02 09:03:13,238 INFO L78 Accepts]: Start accepts. Automaton has 19491 states and 28017 transitions. Word has length 183 [2019-10-02 09:03:13,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:03:13,238 INFO L475 AbstractCegarLoop]: Abstraction has 19491 states and 28017 transitions. [2019-10-02 09:03:13,239 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 09:03:13,239 INFO L276 IsEmpty]: Start isEmpty. Operand 19491 states and 28017 transitions. [2019-10-02 09:03:13,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 09:03:13,246 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:03:13,247 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:03:13,247 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:03:13,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:03:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1172941874, now seen corresponding path program 1 times [2019-10-02 09:03:13,248 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:03:13,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:03:13,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:13,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:13,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:13,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:13,911 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 09:03:13,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:03:13,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 09:03:13,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 09:03:13,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 09:03:13,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:03:13,913 INFO L87 Difference]: Start difference. First operand 19491 states and 28017 transitions. Second operand 4 states. [2019-10-02 09:03:19,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:03:19,487 INFO L93 Difference]: Finished difference Result 38888 states and 56570 transitions. [2019-10-02 09:03:19,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:03:19,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 185 [2019-10-02 09:03:19,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:03:19,552 INFO L225 Difference]: With dead ends: 38888 [2019-10-02 09:03:19,552 INFO L226 Difference]: Without dead ends: 19407 [2019-10-02 09:03:19,613 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:03:19,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19407 states. [2019-10-02 09:03:20,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19407 to 19407. [2019-10-02 09:03:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19407 states. [2019-10-02 09:03:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19407 states to 19407 states and 26995 transitions. [2019-10-02 09:03:20,342 INFO L78 Accepts]: Start accepts. Automaton has 19407 states and 26995 transitions. Word has length 185 [2019-10-02 09:03:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:03:20,342 INFO L475 AbstractCegarLoop]: Abstraction has 19407 states and 26995 transitions. [2019-10-02 09:03:20,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 09:03:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 19407 states and 26995 transitions. [2019-10-02 09:03:20,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 09:03:20,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:03:20,350 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:03:20,351 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:03:20,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:03:20,351 INFO L82 PathProgramCache]: Analyzing trace with hash 413863146, now seen corresponding path program 1 times [2019-10-02 09:03:20,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:03:20,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:03:20,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:20,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:20,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:21,839 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 09:03:21,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:03:21,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 09:03:21,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 09:03:21,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 09:03:21,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:03:21,841 INFO L87 Difference]: Start difference. First operand 19407 states and 26995 transitions. Second operand 4 states. [2019-10-02 09:03:26,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:03:26,545 INFO L93 Difference]: Finished difference Result 38804 states and 54008 transitions. [2019-10-02 09:03:26,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:03:26,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-10-02 09:03:26,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:03:26,609 INFO L225 Difference]: With dead ends: 38804 [2019-10-02 09:03:26,609 INFO L226 Difference]: Without dead ends: 19407 [2019-10-02 09:03:26,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:03:26,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19407 states. [2019-10-02 09:03:27,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19407 to 19407. [2019-10-02 09:03:27,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19407 states. [2019-10-02 09:03:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19407 states to 19407 states and 26967 transitions. [2019-10-02 09:03:27,201 INFO L78 Accepts]: Start accepts. Automaton has 19407 states and 26967 transitions. Word has length 192 [2019-10-02 09:03:27,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:03:27,201 INFO L475 AbstractCegarLoop]: Abstraction has 19407 states and 26967 transitions. [2019-10-02 09:03:27,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 09:03:27,201 INFO L276 IsEmpty]: Start isEmpty. Operand 19407 states and 26967 transitions. [2019-10-02 09:03:27,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 09:03:27,207 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:03:27,207 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:03:27,207 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:03:27,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:03:27,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1380641887, now seen corresponding path program 1 times [2019-10-02 09:03:27,208 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:03:27,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:03:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:27,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:27,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 09:03:27,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:03:27,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 09:03:27,680 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 09:03:27,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 09:03:27,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 09:03:27,681 INFO L87 Difference]: Start difference. First operand 19407 states and 26967 transitions. Second operand 8 states. [2019-10-02 09:03:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:03:31,385 INFO L93 Difference]: Finished difference Result 38867 states and 54007 transitions. [2019-10-02 09:03:31,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 09:03:31,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 193 [2019-10-02 09:03:31,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:03:31,451 INFO L225 Difference]: With dead ends: 38867 [2019-10-02 09:03:31,451 INFO L226 Difference]: Without dead ends: 19379 [2019-10-02 09:03:31,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 09:03:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19379 states. [2019-10-02 09:03:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19379 to 19344. [2019-10-02 09:03:32,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19344 states. [2019-10-02 09:03:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19344 states to 19344 states and 26869 transitions. [2019-10-02 09:03:32,318 INFO L78 Accepts]: Start accepts. Automaton has 19344 states and 26869 transitions. Word has length 193 [2019-10-02 09:03:32,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:03:32,318 INFO L475 AbstractCegarLoop]: Abstraction has 19344 states and 26869 transitions. [2019-10-02 09:03:32,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 09:03:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 19344 states and 26869 transitions. [2019-10-02 09:03:32,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 09:03:32,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:03:32,330 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:03:32,331 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:03:32,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:03:32,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1412881511, now seen corresponding path program 1 times [2019-10-02 09:03:32,333 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:03:32,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:03:32,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:32,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:32,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:32,770 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 09:03:32,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:03:32,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 09:03:32,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 09:03:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 09:03:32,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 09:03:32,773 INFO L87 Difference]: Start difference. First operand 19344 states and 26869 transitions. Second operand 6 states. [2019-10-02 09:03:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:03:36,733 INFO L93 Difference]: Finished difference Result 40943 states and 56352 transitions. [2019-10-02 09:03:36,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 09:03:36,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 213 [2019-10-02 09:03:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:03:36,793 INFO L225 Difference]: With dead ends: 40943 [2019-10-02 09:03:36,793 INFO L226 Difference]: Without dead ends: 21364 [2019-10-02 09:03:36,822 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-02 09:03:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21364 states. [2019-10-02 09:03:37,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21364 to 20625. [2019-10-02 09:03:37,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20625 states. [2019-10-02 09:03:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20625 states to 20625 states and 28204 transitions. [2019-10-02 09:03:37,378 INFO L78 Accepts]: Start accepts. Automaton has 20625 states and 28204 transitions. Word has length 213 [2019-10-02 09:03:37,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:03:37,379 INFO L475 AbstractCegarLoop]: Abstraction has 20625 states and 28204 transitions. [2019-10-02 09:03:37,379 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 09:03:37,379 INFO L276 IsEmpty]: Start isEmpty. Operand 20625 states and 28204 transitions. [2019-10-02 09:03:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 09:03:37,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:03:37,385 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:03:37,385 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:03:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:03:37,386 INFO L82 PathProgramCache]: Analyzing trace with hash 217934209, now seen corresponding path program 1 times [2019-10-02 09:03:37,386 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:03:37,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:03:37,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:37,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:37,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:37,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 09:03:37,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:03:37,959 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:03:38,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:40,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 6389 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 09:03:40,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:03:40,846 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 09:03:41,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:03:41,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-10-02 09:03:41,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:03:41,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:03:41,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:03:41,112 INFO L87 Difference]: Start difference. First operand 20625 states and 28204 transitions. Second operand 5 states. [2019-10-02 09:03:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:03:47,812 INFO L93 Difference]: Finished difference Result 63965 states and 87470 transitions. [2019-10-02 09:03:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:03:47,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2019-10-02 09:03:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:03:48,237 INFO L225 Difference]: With dead ends: 63965 [2019-10-02 09:03:48,237 INFO L226 Difference]: Without dead ends: 63941 [2019-10-02 09:03:48,280 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:03:48,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63941 states. [2019-10-02 09:03:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63941 to 61765. [2019-10-02 09:03:53,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61765 states. [2019-10-02 09:03:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61765 states to 61765 states and 84495 transitions. [2019-10-02 09:03:53,381 INFO L78 Accepts]: Start accepts. Automaton has 61765 states and 84495 transitions. Word has length 235 [2019-10-02 09:03:53,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:03:53,382 INFO L475 AbstractCegarLoop]: Abstraction has 61765 states and 84495 transitions. [2019-10-02 09:03:53,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:03:53,382 INFO L276 IsEmpty]: Start isEmpty. Operand 61765 states and 84495 transitions. [2019-10-02 09:03:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 09:03:53,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:03:53,410 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:03:53,410 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:03:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:03:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1414854644, now seen corresponding path program 1 times [2019-10-02 09:03:53,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:03:53,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:03:53,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:53,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:53,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:03:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-02 09:03:54,389 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:03:54,390 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:03:54,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:03:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:03:57,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 6441 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 09:03:57,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:03:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 09:03:57,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:03:57,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 09:03:57,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 09:03:57,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 09:03:57,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:03:57,266 INFO L87 Difference]: Start difference. First operand 61765 states and 84495 transitions. Second operand 7 states. [2019-10-02 09:04:04,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:04:04,500 INFO L93 Difference]: Finished difference Result 92568 states and 127821 transitions. [2019-10-02 09:04:04,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 09:04:04,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 236 [2019-10-02 09:04:04,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:04:04,626 INFO L225 Difference]: With dead ends: 92568 [2019-10-02 09:04:04,626 INFO L226 Difference]: Without dead ends: 27276 [2019-10-02 09:04:04,856 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-02 09:04:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27276 states. [2019-10-02 09:04:08,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27276 to 27234. [2019-10-02 09:04:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27234 states. [2019-10-02 09:04:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27234 states to 27234 states and 38240 transitions. [2019-10-02 09:04:08,461 INFO L78 Accepts]: Start accepts. Automaton has 27234 states and 38240 transitions. Word has length 236 [2019-10-02 09:04:08,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:04:08,463 INFO L475 AbstractCegarLoop]: Abstraction has 27234 states and 38240 transitions. [2019-10-02 09:04:08,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 09:04:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 27234 states and 38240 transitions. [2019-10-02 09:04:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 09:04:08,501 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:04:08,502 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:04:08,502 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:04:08,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:04:08,503 INFO L82 PathProgramCache]: Analyzing trace with hash 444336748, now seen corresponding path program 1 times [2019-10-02 09:04:08,503 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:04:08,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:04:08,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:08,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:04:08,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:04:09,075 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 09:04:09,076 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:04:09,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:04:09,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:04:09,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:04:09,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:09,078 INFO L87 Difference]: Start difference. First operand 27234 states and 38240 transitions. Second operand 3 states. [2019-10-02 09:04:13,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:04:13,409 INFO L93 Difference]: Finished difference Result 56240 states and 79198 transitions. [2019-10-02 09:04:13,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:04:13,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-02 09:04:13,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:04:13,518 INFO L225 Difference]: With dead ends: 56240 [2019-10-02 09:04:13,518 INFO L226 Difference]: Without dead ends: 31038 [2019-10-02 09:04:13,583 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31038 states. [2019-10-02 09:04:15,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31038 to 31014. [2019-10-02 09:04:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31014 states. [2019-10-02 09:04:15,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31014 states to 31014 states and 43570 transitions. [2019-10-02 09:04:15,725 INFO L78 Accepts]: Start accepts. Automaton has 31014 states and 43570 transitions. Word has length 251 [2019-10-02 09:04:15,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:04:15,726 INFO L475 AbstractCegarLoop]: Abstraction has 31014 states and 43570 transitions. [2019-10-02 09:04:15,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:04:15,727 INFO L276 IsEmpty]: Start isEmpty. Operand 31014 states and 43570 transitions. [2019-10-02 09:04:15,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-02 09:04:15,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:04:15,753 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:04:15,753 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:04:15,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:04:15,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1341244458, now seen corresponding path program 1 times [2019-10-02 09:04:15,754 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:04:15,755 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:04:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:15,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:04:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:04:16,332 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 09:04:16,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:04:16,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:04:16,334 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:04:16,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:04:16,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:16,336 INFO L87 Difference]: Start difference. First operand 31014 states and 43570 transitions. Second operand 3 states. [2019-10-02 09:04:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:04:20,711 INFO L93 Difference]: Finished difference Result 63800 states and 89858 transitions. [2019-10-02 09:04:20,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:04:20,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 253 [2019-10-02 09:04:20,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:04:20,844 INFO L225 Difference]: With dead ends: 63800 [2019-10-02 09:04:20,844 INFO L226 Difference]: Without dead ends: 34818 [2019-10-02 09:04:20,902 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:20,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34818 states. [2019-10-02 09:04:22,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34818 to 34794. [2019-10-02 09:04:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34794 states. [2019-10-02 09:04:22,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34794 states to 34794 states and 48900 transitions. [2019-10-02 09:04:22,538 INFO L78 Accepts]: Start accepts. Automaton has 34794 states and 48900 transitions. Word has length 253 [2019-10-02 09:04:22,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:04:22,539 INFO L475 AbstractCegarLoop]: Abstraction has 34794 states and 48900 transitions. [2019-10-02 09:04:22,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:04:22,539 INFO L276 IsEmpty]: Start isEmpty. Operand 34794 states and 48900 transitions. [2019-10-02 09:04:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-02 09:04:22,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:04:22,555 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:04:22,555 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:04:22,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:04:22,556 INFO L82 PathProgramCache]: Analyzing trace with hash -872671396, now seen corresponding path program 1 times [2019-10-02 09:04:22,556 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:04:22,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:04:22,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:22,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:04:22,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:04:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-02 09:04:22,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:04:22,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:04:22,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:04:22,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:04:22,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:22,937 INFO L87 Difference]: Start difference. First operand 34794 states and 48900 transitions. Second operand 3 states. [2019-10-02 09:04:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:04:26,886 INFO L93 Difference]: Finished difference Result 71360 states and 100518 transitions. [2019-10-02 09:04:26,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:04:26,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 256 [2019-10-02 09:04:26,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:04:27,005 INFO L225 Difference]: With dead ends: 71360 [2019-10-02 09:04:27,005 INFO L226 Difference]: Without dead ends: 38598 [2019-10-02 09:04:27,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:27,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38598 states. [2019-10-02 09:04:28,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38598 to 38574. [2019-10-02 09:04:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38574 states. [2019-10-02 09:04:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38574 states to 38574 states and 54230 transitions. [2019-10-02 09:04:28,582 INFO L78 Accepts]: Start accepts. Automaton has 38574 states and 54230 transitions. Word has length 256 [2019-10-02 09:04:28,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:04:28,583 INFO L475 AbstractCegarLoop]: Abstraction has 38574 states and 54230 transitions. [2019-10-02 09:04:28,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:04:28,583 INFO L276 IsEmpty]: Start isEmpty. Operand 38574 states and 54230 transitions. [2019-10-02 09:04:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2019-10-02 09:04:28,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:04:28,597 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:04:28,597 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:04:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:04:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash -814167474, now seen corresponding path program 1 times [2019-10-02 09:04:28,597 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:04:28,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:04:28,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:28,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:04:28,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:04:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 09:04:28,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:04:28,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:04:28,969 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:04:28,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:04:28,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:28,969 INFO L87 Difference]: Start difference. First operand 38574 states and 54230 transitions. Second operand 3 states. [2019-10-02 09:04:32,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:04:32,874 INFO L93 Difference]: Finished difference Result 67598 states and 95127 transitions. [2019-10-02 09:04:32,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:04:32,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 257 [2019-10-02 09:04:32,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:04:32,966 INFO L225 Difference]: With dead ends: 67598 [2019-10-02 09:04:32,966 INFO L226 Difference]: Without dead ends: 31056 [2019-10-02 09:04:33,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31056 states. [2019-10-02 09:04:33,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31056 to 31032. [2019-10-02 09:04:33,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31032 states. [2019-10-02 09:04:33,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31032 states to 31032 states and 43569 transitions. [2019-10-02 09:04:33,797 INFO L78 Accepts]: Start accepts. Automaton has 31032 states and 43569 transitions. Word has length 257 [2019-10-02 09:04:33,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:04:33,798 INFO L475 AbstractCegarLoop]: Abstraction has 31032 states and 43569 transitions. [2019-10-02 09:04:33,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:04:33,799 INFO L276 IsEmpty]: Start isEmpty. Operand 31032 states and 43569 transitions. [2019-10-02 09:04:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-02 09:04:33,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:04:33,812 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:04:33,813 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:04:33,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:04:33,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1876159773, now seen corresponding path program 1 times [2019-10-02 09:04:33,813 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:04:33,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:04:33,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:33,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:04:33,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:04:34,136 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-02 09:04:34,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:04:34,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:04:34,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:04:34,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:04:34,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:34,138 INFO L87 Difference]: Start difference. First operand 31032 states and 43569 transitions. Second operand 3 states. [2019-10-02 09:04:36,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:04:36,958 INFO L93 Difference]: Finished difference Result 65586 states and 92039 transitions. [2019-10-02 09:04:36,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:04:36,958 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 266 [2019-10-02 09:04:36,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:04:37,055 INFO L225 Difference]: With dead ends: 65586 [2019-10-02 09:04:37,055 INFO L226 Difference]: Without dead ends: 34564 [2019-10-02 09:04:37,110 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:37,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34564 states. [2019-10-02 09:04:37,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34564 to 33450. [2019-10-02 09:04:37,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33450 states. [2019-10-02 09:04:37,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33450 states to 33450 states and 46901 transitions. [2019-10-02 09:04:37,934 INFO L78 Accepts]: Start accepts. Automaton has 33450 states and 46901 transitions. Word has length 266 [2019-10-02 09:04:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:04:37,934 INFO L475 AbstractCegarLoop]: Abstraction has 33450 states and 46901 transitions. [2019-10-02 09:04:37,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:04:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 33450 states and 46901 transitions. [2019-10-02 09:04:37,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-02 09:04:37,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:04:37,944 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:04:37,944 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:04:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:04:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1931717374, now seen corresponding path program 1 times [2019-10-02 09:04:37,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:04:37,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:04:37,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:37,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:04:37,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:38,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:04:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 09:04:38,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:04:38,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:04:38,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:04:38,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:04:38,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:38,310 INFO L87 Difference]: Start difference. First operand 33450 states and 46901 transitions. Second operand 3 states. [2019-10-02 09:04:42,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:04:42,617 INFO L93 Difference]: Finished difference Result 70518 states and 98611 transitions. [2019-10-02 09:04:42,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:04:42,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 265 [2019-10-02 09:04:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:04:42,721 INFO L225 Difference]: With dead ends: 70518 [2019-10-02 09:04:42,721 INFO L226 Difference]: Without dead ends: 37078 [2019-10-02 09:04:42,769 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:42,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37078 states. [2019-10-02 09:04:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37078 to 36906. [2019-10-02 09:04:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36906 states. [2019-10-02 09:04:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36906 states to 36906 states and 51395 transitions. [2019-10-02 09:04:43,644 INFO L78 Accepts]: Start accepts. Automaton has 36906 states and 51395 transitions. Word has length 265 [2019-10-02 09:04:43,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:04:43,645 INFO L475 AbstractCegarLoop]: Abstraction has 36906 states and 51395 transitions. [2019-10-02 09:04:43,645 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:04:43,646 INFO L276 IsEmpty]: Start isEmpty. Operand 36906 states and 51395 transitions. [2019-10-02 09:04:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-02 09:04:43,659 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:04:43,660 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:04:43,660 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:04:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:04:43,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1297415024, now seen corresponding path program 1 times [2019-10-02 09:04:43,661 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:04:43,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:04:43,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:43,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:04:43,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:04:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 09:04:44,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:04:44,009 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:04:44,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:04:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:04:46,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 6511 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 09:04:46,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:04:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 09:04:46,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:04:46,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 09:04:46,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 09:04:46,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 09:04:46,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:04:46,822 INFO L87 Difference]: Start difference. First operand 36906 states and 51395 transitions. Second operand 7 states. [2019-10-02 09:04:52,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:04:52,728 INFO L93 Difference]: Finished difference Result 91923 states and 128619 transitions. [2019-10-02 09:04:52,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:04:52,729 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 265 [2019-10-02 09:04:52,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:04:52,896 INFO L225 Difference]: With dead ends: 91923 [2019-10-02 09:04:52,897 INFO L226 Difference]: Without dead ends: 55081 [2019-10-02 09:04:52,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:04:53,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55081 states. [2019-10-02 09:04:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55081 to 54783. [2019-10-02 09:04:56,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54783 states. [2019-10-02 09:04:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54783 states to 54783 states and 76687 transitions. [2019-10-02 09:04:56,606 INFO L78 Accepts]: Start accepts. Automaton has 54783 states and 76687 transitions. Word has length 265 [2019-10-02 09:04:56,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:04:56,607 INFO L475 AbstractCegarLoop]: Abstraction has 54783 states and 76687 transitions. [2019-10-02 09:04:56,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 09:04:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 54783 states and 76687 transitions. [2019-10-02 09:04:56,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-10-02 09:04:56,619 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:04:56,619 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:04:56,619 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:04:56,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:04:56,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1335280528, now seen corresponding path program 1 times [2019-10-02 09:04:56,620 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:04:56,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:04:56,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:56,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:04:56,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:04:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 09:04:56,908 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:04:56,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:04:56,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:04:56,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:04:56,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:56,909 INFO L87 Difference]: Start difference. First operand 54783 states and 76687 transitions. Second operand 3 states. [2019-10-02 09:04:59,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:04:59,159 INFO L93 Difference]: Finished difference Result 114270 states and 160276 transitions. [2019-10-02 09:04:59,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:04:59,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 274 [2019-10-02 09:04:59,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:04:59,349 INFO L225 Difference]: With dead ends: 114270 [2019-10-02 09:04:59,349 INFO L226 Difference]: Without dead ends: 61525 [2019-10-02 09:04:59,444 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:59,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61525 states. [2019-10-02 09:05:01,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61525 to 61501. [2019-10-02 09:05:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61501 states. [2019-10-02 09:05:01,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61501 states to 61501 states and 86162 transitions. [2019-10-02 09:05:01,390 INFO L78 Accepts]: Start accepts. Automaton has 61501 states and 86162 transitions. Word has length 274 [2019-10-02 09:05:01,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:01,391 INFO L475 AbstractCegarLoop]: Abstraction has 61501 states and 86162 transitions. [2019-10-02 09:05:01,391 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:01,391 INFO L276 IsEmpty]: Start isEmpty. Operand 61501 states and 86162 transitions. [2019-10-02 09:05:01,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 09:05:01,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:01,404 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:01,404 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:01,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:01,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1517371119, now seen corresponding path program 1 times [2019-10-02 09:05:01,405 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:01,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:01,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:01,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:01,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:01,694 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 09:05:01,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:01,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:05:01,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:05:01,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:05:01,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:01,696 INFO L87 Difference]: Start difference. First operand 61501 states and 86162 transitions. Second operand 3 states. [2019-10-02 09:05:04,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:04,605 INFO L93 Difference]: Finished difference Result 127706 states and 179226 transitions. [2019-10-02 09:05:04,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:04,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 280 [2019-10-02 09:05:04,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:04,821 INFO L225 Difference]: With dead ends: 127706 [2019-10-02 09:05:04,821 INFO L226 Difference]: Without dead ends: 68243 [2019-10-02 09:05:04,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68243 states. [2019-10-02 09:05:09,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68243 to 68219. [2019-10-02 09:05:09,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68219 states. [2019-10-02 09:05:09,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68219 states to 68219 states and 95655 transitions. [2019-10-02 09:05:09,696 INFO L78 Accepts]: Start accepts. Automaton has 68219 states and 95655 transitions. Word has length 280 [2019-10-02 09:05:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:09,696 INFO L475 AbstractCegarLoop]: Abstraction has 68219 states and 95655 transitions. [2019-10-02 09:05:09,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 68219 states and 95655 transitions. [2019-10-02 09:05:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2019-10-02 09:05:09,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:09,707 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:09,707 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:09,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:09,707 INFO L82 PathProgramCache]: Analyzing trace with hash -738586762, now seen corresponding path program 1 times [2019-10-02 09:05:09,707 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:09,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:09,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:09,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:09,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:09,992 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 09:05:09,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:09,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:05:09,994 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:05:09,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:05:09,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:09,994 INFO L87 Difference]: Start difference. First operand 68219 states and 95655 transitions. Second operand 3 states. [2019-10-02 09:05:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:15,126 INFO L93 Difference]: Finished difference Result 141142 states and 198212 transitions. [2019-10-02 09:05:15,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:15,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 279 [2019-10-02 09:05:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:15,323 INFO L225 Difference]: With dead ends: 141142 [2019-10-02 09:05:15,323 INFO L226 Difference]: Without dead ends: 74961 [2019-10-02 09:05:15,417 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:15,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74961 states. [2019-10-02 09:05:17,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74961 to 74937. [2019-10-02 09:05:17,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74937 states. [2019-10-02 09:05:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74937 states to 74937 states and 105112 transitions. [2019-10-02 09:05:17,907 INFO L78 Accepts]: Start accepts. Automaton has 74937 states and 105112 transitions. Word has length 279 [2019-10-02 09:05:17,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:17,908 INFO L475 AbstractCegarLoop]: Abstraction has 74937 states and 105112 transitions. [2019-10-02 09:05:17,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:17,908 INFO L276 IsEmpty]: Start isEmpty. Operand 74937 states and 105112 transitions. [2019-10-02 09:05:17,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 09:05:17,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:17,919 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:17,919 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:17,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:17,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1357734964, now seen corresponding path program 1 times [2019-10-02 09:05:17,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:17,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:17,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:17,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:17,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 09:05:18,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:18,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:05:18,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:05:18,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:05:18,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:18,228 INFO L87 Difference]: Start difference. First operand 74937 states and 105112 transitions. Second operand 3 states. [2019-10-02 09:05:22,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:22,914 INFO L93 Difference]: Finished difference Result 147838 states and 207467 transitions. [2019-10-02 09:05:22,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:22,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-10-02 09:05:22,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:23,147 INFO L225 Difference]: With dead ends: 147838 [2019-10-02 09:05:23,148 INFO L226 Difference]: Without dead ends: 74939 [2019-10-02 09:05:26,209 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:26,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74939 states. [2019-10-02 09:05:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74939 to 74845. [2019-10-02 09:05:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74845 states. [2019-10-02 09:05:28,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74845 states to 74845 states and 104957 transitions. [2019-10-02 09:05:28,068 INFO L78 Accepts]: Start accepts. Automaton has 74845 states and 104957 transitions. Word has length 293 [2019-10-02 09:05:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:28,068 INFO L475 AbstractCegarLoop]: Abstraction has 74845 states and 104957 transitions. [2019-10-02 09:05:28,069 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 74845 states and 104957 transitions. [2019-10-02 09:05:28,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 09:05:28,082 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:28,082 INFO L411 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:28,082 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:28,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:28,083 INFO L82 PathProgramCache]: Analyzing trace with hash 955360366, now seen corresponding path program 1 times [2019-10-02 09:05:28,083 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:28,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:28,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:28,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:28,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 09:05:28,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:05:28,969 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:05:29,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:31,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:31,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 6713 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 09:05:31,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:05:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 09:05:31,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:05:31,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 09:05:31,889 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 09:05:31,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 09:05:31,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:05:31,892 INFO L87 Difference]: Start difference. First operand 74845 states and 104957 transitions. Second operand 7 states. [2019-10-02 09:05:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:39,880 INFO L93 Difference]: Finished difference Result 139135 states and 195019 transitions. [2019-10-02 09:05:39,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 09:05:39,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 298 [2019-10-02 09:05:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:40,046 INFO L225 Difference]: With dead ends: 139135 [2019-10-02 09:05:40,046 INFO L226 Difference]: Without dead ends: 64271 [2019-10-02 09:05:40,144 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-10-02 09:05:40,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64271 states. [2019-10-02 09:05:41,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64271 to 60831. [2019-10-02 09:05:41,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60831 states. [2019-10-02 09:05:41,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60831 states to 60831 states and 85181 transitions. [2019-10-02 09:05:41,716 INFO L78 Accepts]: Start accepts. Automaton has 60831 states and 85181 transitions. Word has length 298 [2019-10-02 09:05:41,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:41,717 INFO L475 AbstractCegarLoop]: Abstraction has 60831 states and 85181 transitions. [2019-10-02 09:05:41,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 09:05:41,717 INFO L276 IsEmpty]: Start isEmpty. Operand 60831 states and 85181 transitions. [2019-10-02 09:05:41,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 09:05:41,727 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:41,727 INFO L411 BasicCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:41,727 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:41,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:41,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1601728776, now seen corresponding path program 1 times [2019-10-02 09:05:41,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:41,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:41,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:41,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:42,452 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 5 [2019-10-02 09:05:42,504 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 09:05:42,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:42,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:05:42,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:05:42,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:05:42,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:05:42,505 INFO L87 Difference]: Start difference. First operand 60831 states and 85181 transitions. Second operand 5 states. [2019-10-02 09:05:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:50,510 INFO L93 Difference]: Finished difference Result 178116 states and 249602 transitions. [2019-10-02 09:05:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 09:05:50,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 298 [2019-10-02 09:05:50,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:50,837 INFO L225 Difference]: With dead ends: 178116 [2019-10-02 09:05:50,837 INFO L226 Difference]: Without dead ends: 117349 [2019-10-02 09:05:50,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:05:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117349 states. [2019-10-02 09:05:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117349 to 62480. [2019-10-02 09:05:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62480 states. [2019-10-02 09:05:53,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62480 states to 62480 states and 87302 transitions. [2019-10-02 09:05:53,436 INFO L78 Accepts]: Start accepts. Automaton has 62480 states and 87302 transitions. Word has length 298 [2019-10-02 09:05:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:53,437 INFO L475 AbstractCegarLoop]: Abstraction has 62480 states and 87302 transitions. [2019-10-02 09:05:53,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:05:53,437 INFO L276 IsEmpty]: Start isEmpty. Operand 62480 states and 87302 transitions. [2019-10-02 09:05:53,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-10-02 09:05:53,448 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:53,448 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:53,448 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:53,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:53,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1826560691, now seen corresponding path program 1 times [2019-10-02 09:05:53,449 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:53,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:53,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:53,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:53,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:53,735 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 09:05:53,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:53,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:05:53,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:05:53,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:05:53,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:53,736 INFO L87 Difference]: Start difference. First operand 62480 states and 87302 transitions. Second operand 3 states. [2019-10-02 09:05:59,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:59,132 INFO L93 Difference]: Finished difference Result 126835 states and 177438 transitions. [2019-10-02 09:05:59,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:59,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-10-02 09:05:59,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:59,323 INFO L225 Difference]: With dead ends: 126835 [2019-10-02 09:05:59,324 INFO L226 Difference]: Without dead ends: 68334 [2019-10-02 09:05:59,409 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:59,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68334 states. [2019-10-02 09:06:04,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68334 to 64128. [2019-10-02 09:06:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64128 states. [2019-10-02 09:06:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64128 states to 64128 states and 89521 transitions. [2019-10-02 09:06:04,688 INFO L78 Accepts]: Start accepts. Automaton has 64128 states and 89521 transitions. Word has length 307 [2019-10-02 09:06:04,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:04,689 INFO L475 AbstractCegarLoop]: Abstraction has 64128 states and 89521 transitions. [2019-10-02 09:06:04,689 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:06:04,689 INFO L276 IsEmpty]: Start isEmpty. Operand 64128 states and 89521 transitions. [2019-10-02 09:06:04,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 09:06:04,701 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:04,701 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:04,702 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:04,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:04,702 INFO L82 PathProgramCache]: Analyzing trace with hash 982050068, now seen corresponding path program 1 times [2019-10-02 09:06:04,702 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:04,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:04,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:04,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:04,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 09:06:05,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:05,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:06:05,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:06:05,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:06:05,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:06:05,059 INFO L87 Difference]: Start difference. First operand 64128 states and 89521 transitions. Second operand 3 states. [2019-10-02 09:06:10,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:10,374 INFO L93 Difference]: Finished difference Result 130131 states and 181876 transitions. [2019-10-02 09:06:10,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:06:10,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-02 09:06:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:10,565 INFO L225 Difference]: With dead ends: 130131 [2019-10-02 09:06:10,565 INFO L226 Difference]: Without dead ends: 69982 [2019-10-02 09:06:10,650 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:06:10,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69982 states. [2019-10-02 09:06:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69982 to 65776. [2019-10-02 09:06:13,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65776 states. [2019-10-02 09:06:13,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65776 states to 65776 states and 91740 transitions. [2019-10-02 09:06:13,257 INFO L78 Accepts]: Start accepts. Automaton has 65776 states and 91740 transitions. Word has length 314 [2019-10-02 09:06:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:13,257 INFO L475 AbstractCegarLoop]: Abstraction has 65776 states and 91740 transitions. [2019-10-02 09:06:13,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:06:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 65776 states and 91740 transitions. [2019-10-02 09:06:13,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-10-02 09:06:13,271 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:13,272 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:13,272 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:13,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:13,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1654960045, now seen corresponding path program 1 times [2019-10-02 09:06:13,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:13,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:13,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:13,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:13,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-10-02 09:06:13,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:13,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:06:13,581 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:06:13,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:06:13,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:06:13,581 INFO L87 Difference]: Start difference. First operand 65776 states and 91740 transitions. Second operand 3 states. [2019-10-02 09:06:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:18,435 INFO L93 Difference]: Finished difference Result 125282 states and 174934 transitions. [2019-10-02 09:06:18,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:06:18,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-10-02 09:06:18,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:18,657 INFO L225 Difference]: With dead ends: 125282 [2019-10-02 09:06:18,657 INFO L226 Difference]: Without dead ends: 63485 [2019-10-02 09:06:21,895 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:06:21,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63485 states. [2019-10-02 09:06:23,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63485 to 59279. [2019-10-02 09:06:23,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59279 states. [2019-10-02 09:06:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59279 states to 59279 states and 82567 transitions. [2019-10-02 09:06:23,743 INFO L78 Accepts]: Start accepts. Automaton has 59279 states and 82567 transitions. Word has length 314 [2019-10-02 09:06:23,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:23,743 INFO L475 AbstractCegarLoop]: Abstraction has 59279 states and 82567 transitions. [2019-10-02 09:06:23,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:06:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 59279 states and 82567 transitions. [2019-10-02 09:06:23,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-10-02 09:06:23,764 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:23,765 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:23,765 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:23,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1072819203, now seen corresponding path program 1 times [2019-10-02 09:06:23,765 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:23,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:23,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:23,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:24,338 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-02 09:06:24,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:24,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:06:24,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:06:24,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:06:24,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:06:24,340 INFO L87 Difference]: Start difference. First operand 59279 states and 82567 transitions. Second operand 3 states. [2019-10-02 09:06:28,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:28,968 INFO L93 Difference]: Finished difference Result 106095 states and 147848 transitions. [2019-10-02 09:06:28,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:06:28,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 346 [2019-10-02 09:06:28,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:29,151 INFO L225 Difference]: With dead ends: 106095 [2019-10-02 09:06:29,151 INFO L226 Difference]: Without dead ends: 50795 [2019-10-02 09:06:29,248 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:06:29,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50795 states. [2019-10-02 09:06:31,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50795 to 50794. [2019-10-02 09:06:31,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50794 states. [2019-10-02 09:06:31,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50794 states to 50794 states and 70618 transitions. [2019-10-02 09:06:31,337 INFO L78 Accepts]: Start accepts. Automaton has 50794 states and 70618 transitions. Word has length 346 [2019-10-02 09:06:31,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:31,338 INFO L475 AbstractCegarLoop]: Abstraction has 50794 states and 70618 transitions. [2019-10-02 09:06:31,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:06:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 50794 states and 70618 transitions. [2019-10-02 09:06:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-10-02 09:06:31,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:31,359 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:31,359 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:31,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:31,360 INFO L82 PathProgramCache]: Analyzing trace with hash -508344864, now seen corresponding path program 1 times [2019-10-02 09:06:31,360 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:31,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:31,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:31,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:31,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:31,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2019-10-02 09:06:31,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:31,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:06:31,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:06:31,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:06:31,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:06:31,672 INFO L87 Difference]: Start difference. First operand 50794 states and 70618 transitions. Second operand 5 states. [2019-10-02 09:06:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:34,080 INFO L93 Difference]: Finished difference Result 50828 states and 70652 transitions. [2019-10-02 09:06:34,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:06:34,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 348 [2019-10-02 09:06:34,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:34,237 INFO L225 Difference]: With dead ends: 50828 [2019-10-02 09:06:34,237 INFO L226 Difference]: Without dead ends: 49387 [2019-10-02 09:06:34,264 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:06:34,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49387 states. [2019-10-02 09:06:35,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49387 to 49387. [2019-10-02 09:06:35,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49387 states. [2019-10-02 09:06:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49387 states to 49387 states and 68641 transitions. [2019-10-02 09:06:35,842 INFO L78 Accepts]: Start accepts. Automaton has 49387 states and 68641 transitions. Word has length 348 [2019-10-02 09:06:35,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:35,842 INFO L475 AbstractCegarLoop]: Abstraction has 49387 states and 68641 transitions. [2019-10-02 09:06:35,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:06:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 49387 states and 68641 transitions. [2019-10-02 09:06:35,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-10-02 09:06:35,863 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:35,864 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:35,864 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:35,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:35,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1465897513, now seen corresponding path program 1 times [2019-10-02 09:06:35,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:35,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:35,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:35,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:35,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:36,635 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2019-10-02 09:06:36,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:36,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:06:36,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:06:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:06:36,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:06:36,637 INFO L87 Difference]: Start difference. First operand 49387 states and 68641 transitions. Second operand 5 states. [2019-10-02 09:06:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:38,753 INFO L93 Difference]: Finished difference Result 49421 states and 68675 transitions. [2019-10-02 09:06:38,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:06:38,754 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 350 [2019-10-02 09:06:38,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:38,924 INFO L225 Difference]: With dead ends: 49421 [2019-10-02 09:06:38,924 INFO L226 Difference]: Without dead ends: 47980 [2019-10-02 09:06:38,961 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:06:39,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47980 states. [2019-10-02 09:06:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47980 to 47980. [2019-10-02 09:06:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47980 states. [2019-10-02 09:06:40,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47980 states to 47980 states and 66664 transitions. [2019-10-02 09:06:40,920 INFO L78 Accepts]: Start accepts. Automaton has 47980 states and 66664 transitions. Word has length 350 [2019-10-02 09:06:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:40,921 INFO L475 AbstractCegarLoop]: Abstraction has 47980 states and 66664 transitions. [2019-10-02 09:06:40,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:06:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 47980 states and 66664 transitions. [2019-10-02 09:06:40,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2019-10-02 09:06:40,944 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:40,944 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:40,944 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:40,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:40,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1963052660, now seen corresponding path program 1 times [2019-10-02 09:06:40,945 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:40,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:40,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:40,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:40,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:41,243 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-10-02 09:06:41,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:41,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:06:41,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:06:41,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:06:41,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:06:41,244 INFO L87 Difference]: Start difference. First operand 47980 states and 66664 transitions. Second operand 5 states. [2019-10-02 09:06:43,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:43,720 INFO L93 Difference]: Finished difference Result 47982 states and 66665 transitions. [2019-10-02 09:06:43,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:06:43,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 351 [2019-10-02 09:06:43,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:43,844 INFO L225 Difference]: With dead ends: 47982 [2019-10-02 09:06:43,844 INFO L226 Difference]: Without dead ends: 45343 [2019-10-02 09:06:43,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:06:43,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45343 states. [2019-10-02 09:06:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45343 to 45343. [2019-10-02 09:06:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45343 states. [2019-10-02 09:06:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45343 states to 45343 states and 63014 transitions. [2019-10-02 09:06:45,377 INFO L78 Accepts]: Start accepts. Automaton has 45343 states and 63014 transitions. Word has length 351 [2019-10-02 09:06:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:45,377 INFO L475 AbstractCegarLoop]: Abstraction has 45343 states and 63014 transitions. [2019-10-02 09:06:45,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:06:45,378 INFO L276 IsEmpty]: Start isEmpty. Operand 45343 states and 63014 transitions. [2019-10-02 09:06:45,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-10-02 09:06:45,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:45,402 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:45,403 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:45,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:45,403 INFO L82 PathProgramCache]: Analyzing trace with hash -515319559, now seen corresponding path program 1 times [2019-10-02 09:06:45,403 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:45,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:45,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:45,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:45,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:45,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 09:06:45,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:45,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:06:45,793 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:06:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:06:45,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:06:45,796 INFO L87 Difference]: Start difference. First operand 45343 states and 63014 transitions. Second operand 5 states. [2019-10-02 09:06:47,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:47,912 INFO L93 Difference]: Finished difference Result 91207 states and 128103 transitions. [2019-10-02 09:06:47,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 09:06:47,913 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 366 [2019-10-02 09:06:47,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:48,082 INFO L225 Difference]: With dead ends: 91207 [2019-10-02 09:06:48,082 INFO L226 Difference]: Without dead ends: 45928 [2019-10-02 09:06:48,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 09:06:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45928 states. [2019-10-02 09:06:50,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45928 to 45603. [2019-10-02 09:06:50,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45603 states. [2019-10-02 09:06:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45603 states to 45603 states and 63404 transitions. [2019-10-02 09:06:50,278 INFO L78 Accepts]: Start accepts. Automaton has 45603 states and 63404 transitions. Word has length 366 [2019-10-02 09:06:50,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:50,279 INFO L475 AbstractCegarLoop]: Abstraction has 45603 states and 63404 transitions. [2019-10-02 09:06:50,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:06:50,279 INFO L276 IsEmpty]: Start isEmpty. Operand 45603 states and 63404 transitions. [2019-10-02 09:06:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-10-02 09:06:50,308 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:50,308 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:50,308 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:50,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:50,309 INFO L82 PathProgramCache]: Analyzing trace with hash -921753384, now seen corresponding path program 1 times [2019-10-02 09:06:50,309 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:50,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:50,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:50,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:50,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-10-02 09:06:50,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:50,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:06:50,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:06:50,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:06:50,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:06:50,658 INFO L87 Difference]: Start difference. First operand 45603 states and 63404 transitions. Second operand 5 states. [2019-10-02 09:06:52,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:52,448 INFO L93 Difference]: Finished difference Result 91532 states and 128688 transitions. [2019-10-02 09:06:52,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:06:52,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 400 [2019-10-02 09:06:52,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:52,605 INFO L225 Difference]: With dead ends: 91532 [2019-10-02 09:06:52,605 INFO L226 Difference]: Without dead ends: 45993 [2019-10-02 09:06:52,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:06:52,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45993 states. [2019-10-02 09:06:54,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45993 to 45863. [2019-10-02 09:06:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45863 states. [2019-10-02 09:06:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45863 states to 45863 states and 63924 transitions. [2019-10-02 09:06:54,254 INFO L78 Accepts]: Start accepts. Automaton has 45863 states and 63924 transitions. Word has length 400 [2019-10-02 09:06:54,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:54,255 INFO L475 AbstractCegarLoop]: Abstraction has 45863 states and 63924 transitions. [2019-10-02 09:06:54,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:06:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 45863 states and 63924 transitions. [2019-10-02 09:06:54,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2019-10-02 09:06:54,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:54,277 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:54,278 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1795075632, now seen corresponding path program 1 times [2019-10-02 09:06:54,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:54,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:54,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:54,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-02 09:06:55,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:55,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:06:55,064 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:06:55,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:06:55,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:06:55,065 INFO L87 Difference]: Start difference. First operand 45863 states and 63924 transitions. Second operand 5 states. [2019-10-02 09:06:56,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:56,597 INFO L93 Difference]: Finished difference Result 92832 states and 131223 transitions. [2019-10-02 09:06:56,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:06:56,597 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 401 [2019-10-02 09:06:56,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:56,796 INFO L225 Difference]: With dead ends: 92832 [2019-10-02 09:06:56,796 INFO L226 Difference]: Without dead ends: 47033 [2019-10-02 09:06:56,898 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:06:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47033 states. [2019-10-02 09:06:58,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47033 to 46123. [2019-10-02 09:06:58,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46123 states. [2019-10-02 09:06:58,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46123 states to 46123 states and 64249 transitions. [2019-10-02 09:06:58,974 INFO L78 Accepts]: Start accepts. Automaton has 46123 states and 64249 transitions. Word has length 401 [2019-10-02 09:06:58,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:58,975 INFO L475 AbstractCegarLoop]: Abstraction has 46123 states and 64249 transitions. [2019-10-02 09:06:58,975 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:06:58,975 INFO L276 IsEmpty]: Start isEmpty. Operand 46123 states and 64249 transitions. [2019-10-02 09:06:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2019-10-02 09:06:58,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:58,998 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:58,999 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:58,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:58,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1916994377, now seen corresponding path program 1 times [2019-10-02 09:06:58,999 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:58,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:59,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:59,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:59,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:59,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-02 09:06:59,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:59,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 09:06:59,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 09:06:59,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 09:06:59,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:06:59,366 INFO L87 Difference]: Start difference. First operand 46123 states and 64249 transitions. Second operand 4 states. [2019-10-02 09:07:01,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:07:01,179 INFO L93 Difference]: Finished difference Result 93222 states and 132718 transitions. [2019-10-02 09:07:01,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 09:07:01,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 403 [2019-10-02 09:07:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:07:01,352 INFO L225 Difference]: With dead ends: 93222 [2019-10-02 09:07:01,352 INFO L226 Difference]: Without dead ends: 47163 [2019-10-02 09:07:01,461 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:07:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47163 states. [2019-10-02 09:07:03,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47163 to 46578. [2019-10-02 09:07:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46578 states. [2019-10-02 09:07:03,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46578 states to 46578 states and 64834 transitions. [2019-10-02 09:07:03,584 INFO L78 Accepts]: Start accepts. Automaton has 46578 states and 64834 transitions. Word has length 403 [2019-10-02 09:07:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:07:03,585 INFO L475 AbstractCegarLoop]: Abstraction has 46578 states and 64834 transitions. [2019-10-02 09:07:03,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 09:07:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 46578 states and 64834 transitions. [2019-10-02 09:07:03,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-10-02 09:07:03,607 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:07:03,607 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:07:03,608 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:07:03,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:07:03,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1989786079, now seen corresponding path program 1 times [2019-10-02 09:07:03,608 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:07:03,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:07:03,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:03,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:03,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-10-02 09:07:03,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:07:03,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:07:03,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:07:03,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:07:03,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:07:03,902 INFO L87 Difference]: Start difference. First operand 46578 states and 64834 transitions. Second operand 3 states. [2019-10-02 09:07:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:07:14,569 INFO L93 Difference]: Finished difference Result 96472 states and 135123 transitions. [2019-10-02 09:07:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:07:14,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-10-02 09:07:14,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:07:14,761 INFO L225 Difference]: With dead ends: 96472 [2019-10-02 09:07:14,761 INFO L226 Difference]: Without dead ends: 49958 [2019-10-02 09:07:14,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:07:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49958 states. [2019-10-02 09:07:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49958 to 46968. [2019-10-02 09:07:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46968 states. [2019-10-02 09:07:19,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46968 states to 46968 states and 65224 transitions. [2019-10-02 09:07:19,995 INFO L78 Accepts]: Start accepts. Automaton has 46968 states and 65224 transitions. Word has length 409 [2019-10-02 09:07:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:07:19,996 INFO L475 AbstractCegarLoop]: Abstraction has 46968 states and 65224 transitions. [2019-10-02 09:07:19,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:07:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 46968 states and 65224 transitions. [2019-10-02 09:07:20,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2019-10-02 09:07:20,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:07:20,013 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:07:20,013 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:07:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:07:20,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1302741619, now seen corresponding path program 1 times [2019-10-02 09:07:20,015 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:07:20,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:07:20,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:20,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:20,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:20,561 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-02 09:07:20,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:07:20,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 09:07:20,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 09:07:20,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 09:07:20,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 09:07:20,563 INFO L87 Difference]: Start difference. First operand 46968 states and 65224 transitions. Second operand 6 states. [2019-10-02 09:07:31,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:07:31,261 INFO L93 Difference]: Finished difference Result 137719 states and 191557 transitions. [2019-10-02 09:07:31,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 09:07:31,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 416 [2019-10-02 09:07:31,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:07:31,561 INFO L225 Difference]: With dead ends: 137719 [2019-10-02 09:07:31,561 INFO L226 Difference]: Without dead ends: 90815 [2019-10-02 09:07:31,651 INFO L640 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-10-02 09:07:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90815 states. [2019-10-02 09:07:34,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90815 to 47553. [2019-10-02 09:07:34,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47553 states. [2019-10-02 09:07:34,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47553 states to 47553 states and 66069 transitions. [2019-10-02 09:07:34,224 INFO L78 Accepts]: Start accepts. Automaton has 47553 states and 66069 transitions. Word has length 416 [2019-10-02 09:07:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:07:34,224 INFO L475 AbstractCegarLoop]: Abstraction has 47553 states and 66069 transitions. [2019-10-02 09:07:34,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 09:07:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 47553 states and 66069 transitions. [2019-10-02 09:07:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2019-10-02 09:07:34,253 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:07:34,253 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:07:34,254 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:07:34,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:07:34,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1116926564, now seen corresponding path program 1 times [2019-10-02 09:07:34,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:07:34,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:07:34,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:34,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:34,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 1239 trivial. 0 not checked. [2019-10-02 09:07:34,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:07:34,788 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:07:35,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:38,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:38,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 8908 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 09:07:38,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:07:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 1272 backedges. 528 proven. 0 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2019-10-02 09:07:39,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:07:39,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 09:07:39,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 09:07:39,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 09:07:39,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 09:07:39,111 INFO L87 Difference]: Start difference. First operand 47553 states and 66069 transitions. Second operand 9 states. [2019-10-02 09:07:42,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:07:42,984 INFO L93 Difference]: Finished difference Result 97057 states and 136683 transitions. [2019-10-02 09:07:42,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 09:07:42,986 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 734 [2019-10-02 09:07:42,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:07:43,179 INFO L225 Difference]: With dead ends: 97057 [2019-10-02 09:07:43,179 INFO L226 Difference]: Without dead ends: 49308 [2019-10-02 09:07:43,274 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 745 GetRequests, 734 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-10-02 09:07:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49308 states. [2019-10-02 09:07:45,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49308 to 48463. [2019-10-02 09:07:45,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48463 states. [2019-10-02 09:07:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48463 states to 48463 states and 68149 transitions. [2019-10-02 09:07:45,543 INFO L78 Accepts]: Start accepts. Automaton has 48463 states and 68149 transitions. Word has length 734 [2019-10-02 09:07:45,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:07:45,543 INFO L475 AbstractCegarLoop]: Abstraction has 48463 states and 68149 transitions. [2019-10-02 09:07:45,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 09:07:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 48463 states and 68149 transitions. [2019-10-02 09:07:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 732 [2019-10-02 09:07:45,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:07:45,576 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:07:45,576 INFO L418 AbstractCegarLoop]: === Iteration 49 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:07:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:07:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1431703346, now seen corresponding path program 1 times [2019-10-02 09:07:45,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:07:45,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:07:45,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:45,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:45,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:45,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:46,069 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 23 proven. 95 refuted. 0 times theorem prover too weak. 1181 trivial. 0 not checked. [2019-10-02 09:07:46,070 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:07:46,070 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:07:46,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:52,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 8868 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 09:07:52,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:07:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2019-10-02 09:07:52,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:07:52,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [5] total 11 [2019-10-02 09:07:52,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 09:07:52,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 09:07:52,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 09:07:52,595 INFO L87 Difference]: Start difference. First operand 48463 states and 68149 transitions. Second operand 11 states. [2019-10-02 09:07:55,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:07:55,619 INFO L93 Difference]: Finished difference Result 98227 states and 141363 transitions. [2019-10-02 09:07:55,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 09:07:55,619 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 731 [2019-10-02 09:07:55,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:07:55,784 INFO L225 Difference]: With dead ends: 98227 [2019-10-02 09:07:55,784 INFO L226 Difference]: Without dead ends: 49828 [2019-10-02 09:07:55,882 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 736 GetRequests, 726 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-02 09:07:55,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49828 states. [2019-10-02 09:07:57,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49828 to 48593. [2019-10-02 09:07:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48593 states. [2019-10-02 09:07:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48593 states to 48593 states and 68214 transitions. [2019-10-02 09:07:58,135 INFO L78 Accepts]: Start accepts. Automaton has 48593 states and 68214 transitions. Word has length 731 [2019-10-02 09:07:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:07:58,135 INFO L475 AbstractCegarLoop]: Abstraction has 48593 states and 68214 transitions. [2019-10-02 09:07:58,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 09:07:58,135 INFO L276 IsEmpty]: Start isEmpty. Operand 48593 states and 68214 transitions. [2019-10-02 09:07:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 872 [2019-10-02 09:07:58,167 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:07:58,167 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 12, 12, 12, 12, 10, 10, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:07:58,168 INFO L418 AbstractCegarLoop]: === Iteration 50 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:07:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:07:58,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1873091833, now seen corresponding path program 1 times [2019-10-02 09:07:58,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:07:58,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:07:58,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:58,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:58,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:58,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:58,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 50 proven. 100 refuted. 0 times theorem prover too weak. 2622 trivial. 0 not checked. [2019-10-02 09:07:58,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:07:58,786 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:07:59,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:02,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 9162 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 09:08:02,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:08:02,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 1168 proven. 1 refuted. 0 times theorem prover too weak. 1603 trivial. 0 not checked. [2019-10-02 09:08:02,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 09:08:02,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 8 [2019-10-02 09:08:02,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 09:08:02,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 09:08:02,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 09:08:02,999 INFO L87 Difference]: Start difference. First operand 48593 states and 68214 transitions. Second operand 8 states. [2019-10-02 09:08:05,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:08:05,952 INFO L93 Difference]: Finished difference Result 102647 states and 151698 transitions. [2019-10-02 09:08:05,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 09:08:05,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 871 [2019-10-02 09:08:05,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:08:06,198 INFO L225 Difference]: With dead ends: 102647 [2019-10-02 09:08:06,198 INFO L226 Difference]: Without dead ends: 54118 [2019-10-02 09:08:06,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 880 GetRequests, 871 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-02 09:08:06,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54118 states. [2019-10-02 09:08:08,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54118 to 50543. [2019-10-02 09:08:08,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50543 states. [2019-10-02 09:08:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50543 states to 50543 states and 70944 transitions. [2019-10-02 09:08:08,924 INFO L78 Accepts]: Start accepts. Automaton has 50543 states and 70944 transitions. Word has length 871 [2019-10-02 09:08:08,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:08:08,925 INFO L475 AbstractCegarLoop]: Abstraction has 50543 states and 70944 transitions. [2019-10-02 09:08:08,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 09:08:08,925 INFO L276 IsEmpty]: Start isEmpty. Operand 50543 states and 70944 transitions. [2019-10-02 09:08:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 910 [2019-10-02 09:08:08,967 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:08:08,967 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:08:08,968 INFO L418 AbstractCegarLoop]: === Iteration 51 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:08:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:08:08,968 INFO L82 PathProgramCache]: Analyzing trace with hash -49630168, now seen corresponding path program 1 times [2019-10-02 09:08:08,968 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:08:08,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:08:08,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:08,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:08,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 2902 backedges. 29 proven. 20 refuted. 0 times theorem prover too weak. 2853 trivial. 0 not checked. [2019-10-02 09:08:09,987 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:08:09,987 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:08:10,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:13,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 9351 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 09:08:13,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:08:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 2902 backedges. 1308 proven. 0 refuted. 0 times theorem prover too weak. 1594 trivial. 0 not checked. [2019-10-02 09:08:14,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:08:14,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2019-10-02 09:08:14,231 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 09:08:14,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 09:08:14,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:08:14,231 INFO L87 Difference]: Start difference. First operand 50543 states and 70944 transitions. Second operand 7 states. [2019-10-02 09:08:19,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:08:19,087 INFO L93 Difference]: Finished difference Result 102907 states and 147733 transitions. [2019-10-02 09:08:19,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 09:08:19,088 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 909 [2019-10-02 09:08:19,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:08:19,295 INFO L225 Difference]: With dead ends: 102907 [2019-10-02 09:08:19,296 INFO L226 Difference]: Without dead ends: 51648 [2019-10-02 09:08:19,417 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 919 GetRequests, 910 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-02 09:08:19,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51648 states. [2019-10-02 09:08:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51648 to 50933. [2019-10-02 09:08:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50933 states. [2019-10-02 09:08:21,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50933 states to 50933 states and 71139 transitions. [2019-10-02 09:08:21,814 INFO L78 Accepts]: Start accepts. Automaton has 50933 states and 71139 transitions. Word has length 909 [2019-10-02 09:08:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:08:21,815 INFO L475 AbstractCegarLoop]: Abstraction has 50933 states and 71139 transitions. [2019-10-02 09:08:21,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 09:08:21,815 INFO L276 IsEmpty]: Start isEmpty. Operand 50933 states and 71139 transitions. [2019-10-02 09:08:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2019-10-02 09:08:21,856 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:08:21,857 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:08:21,857 INFO L418 AbstractCegarLoop]: === Iteration 52 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:08:21,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:08:21,858 INFO L82 PathProgramCache]: Analyzing trace with hash 726676179, now seen corresponding path program 1 times [2019-10-02 09:08:21,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:08:21,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:08:21,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:21,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:21,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 2957 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 2934 trivial. 0 not checked. [2019-10-02 09:08:23,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:08:23,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 09:08:23,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 09:08:23,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 09:08:23,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 09:08:23,004 INFO L87 Difference]: Start difference. First operand 50933 states and 71139 transitions. Second operand 6 states. [2019-10-02 09:08:41,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:08:41,002 INFO L93 Difference]: Finished difference Result 153947 states and 216123 transitions. [2019-10-02 09:08:41,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 09:08:41,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 914 [2019-10-02 09:08:41,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:08:41,501 INFO L225 Difference]: With dead ends: 153947 [2019-10-02 09:08:41,502 INFO L226 Difference]: Without dead ends: 103078 [2019-10-02 09:08:41,689 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 09:08:41,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103078 states. [2019-10-02 09:08:44,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103078 to 53741. [2019-10-02 09:08:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53741 states. [2019-10-02 09:08:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53741 states to 53741 states and 75049 transitions. [2019-10-02 09:08:44,813 INFO L78 Accepts]: Start accepts. Automaton has 53741 states and 75049 transitions. Word has length 914 [2019-10-02 09:08:44,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:08:44,814 INFO L475 AbstractCegarLoop]: Abstraction has 53741 states and 75049 transitions. [2019-10-02 09:08:44,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 09:08:44,814 INFO L276 IsEmpty]: Start isEmpty. Operand 53741 states and 75049 transitions. [2019-10-02 09:08:44,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 972 [2019-10-02 09:08:44,862 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:08:44,863 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:08:44,863 INFO L418 AbstractCegarLoop]: === Iteration 53 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:08:44,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:08:44,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1732066870, now seen corresponding path program 1 times [2019-10-02 09:08:44,864 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:08:44,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:08:44,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:44,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3006 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 2983 trivial. 0 not checked. [2019-10-02 09:08:46,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:08:46,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 09:08:46,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 09:08:46,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 09:08:46,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:08:46,173 INFO L87 Difference]: Start difference. First operand 53741 states and 75049 transitions. Second operand 4 states. [2019-10-02 09:08:55,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:08:55,140 INFO L93 Difference]: Finished difference Result 107073 states and 149761 transitions. [2019-10-02 09:08:55,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:08:55,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 971 [2019-10-02 09:08:55,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:08:55,404 INFO L225 Difference]: With dead ends: 107073 [2019-10-02 09:08:55,404 INFO L226 Difference]: Without dead ends: 53396 [2019-10-02 09:08:55,589 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:08:55,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53396 states. [2019-10-02 09:08:58,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53396 to 53396. [2019-10-02 09:08:58,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53396 states. [2019-10-02 09:08:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53396 states to 53396 states and 74497 transitions. [2019-10-02 09:08:58,303 INFO L78 Accepts]: Start accepts. Automaton has 53396 states and 74497 transitions. Word has length 971 [2019-10-02 09:08:58,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:08:58,306 INFO L475 AbstractCegarLoop]: Abstraction has 53396 states and 74497 transitions. [2019-10-02 09:08:58,307 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 09:08:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 53396 states and 74497 transitions. [2019-10-02 09:08:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2019-10-02 09:08:58,362 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:08:58,363 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:08:58,363 INFO L418 AbstractCegarLoop]: === Iteration 54 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:08:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:08:58,364 INFO L82 PathProgramCache]: Analyzing trace with hash -237090264, now seen corresponding path program 1 times [2019-10-02 09:08:58,364 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:08:58,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:08:58,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:58,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:58,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:58,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3031 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3008 trivial. 0 not checked. [2019-10-02 09:08:59,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:08:59,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:08:59,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:08:59,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:08:59,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:08:59,638 INFO L87 Difference]: Start difference. First operand 53396 states and 74497 transitions. Second operand 3 states. [2019-10-02 09:09:02,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:09:02,355 INFO L93 Difference]: Finished difference Result 108453 states and 151693 transitions. [2019-10-02 09:09:02,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:09:02,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 982 [2019-10-02 09:09:02,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:09:02,596 INFO L225 Difference]: With dead ends: 108453 [2019-10-02 09:09:02,596 INFO L226 Difference]: Without dead ends: 55121 [2019-10-02 09:09:02,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:09:02,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55121 states. [2019-10-02 09:09:05,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55121 to 53465. [2019-10-02 09:09:05,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53465 states. [2019-10-02 09:09:05,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53465 states to 53465 states and 74566 transitions. [2019-10-02 09:09:05,584 INFO L78 Accepts]: Start accepts. Automaton has 53465 states and 74566 transitions. Word has length 982 [2019-10-02 09:09:05,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:09:05,585 INFO L475 AbstractCegarLoop]: Abstraction has 53465 states and 74566 transitions. [2019-10-02 09:09:05,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:09:05,585 INFO L276 IsEmpty]: Start isEmpty. Operand 53465 states and 74566 transitions. [2019-10-02 09:09:05,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 989 [2019-10-02 09:09:05,637 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:09:05,637 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:09:05,637 INFO L418 AbstractCegarLoop]: === Iteration 55 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:09:05,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:09:05,638 INFO L82 PathProgramCache]: Analyzing trace with hash 38277662, now seen corresponding path program 1 times [2019-10-02 09:09:05,638 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:09:05,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:09:05,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:05,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:09:05,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:09:06,378 INFO L134 CoverageAnalysis]: Checked inductivity of 3033 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3010 trivial. 0 not checked. [2019-10-02 09:09:06,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:09:06,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 09:09:06,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 09:09:06,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 09:09:06,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:09:06,379 INFO L87 Difference]: Start difference. First operand 53465 states and 74566 transitions. Second operand 4 states. [2019-10-02 09:09:12,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:09:12,922 INFO L93 Difference]: Finished difference Result 106521 states and 148795 transitions. [2019-10-02 09:09:12,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:09:12,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 988 [2019-10-02 09:09:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:09:13,132 INFO L225 Difference]: With dead ends: 106521 [2019-10-02 09:09:13,132 INFO L226 Difference]: Without dead ends: 53120 [2019-10-02 09:09:13,258 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:09:13,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53120 states. [2019-10-02 09:09:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53120 to 53120. [2019-10-02 09:09:15,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53120 states. [2019-10-02 09:09:16,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53120 states to 53120 states and 74014 transitions. [2019-10-02 09:09:16,055 INFO L78 Accepts]: Start accepts. Automaton has 53120 states and 74014 transitions. Word has length 988 [2019-10-02 09:09:16,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:09:16,056 INFO L475 AbstractCegarLoop]: Abstraction has 53120 states and 74014 transitions. [2019-10-02 09:09:16,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 09:09:16,056 INFO L276 IsEmpty]: Start isEmpty. Operand 53120 states and 74014 transitions. [2019-10-02 09:09:16,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 999 [2019-10-02 09:09:16,100 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:09:16,100 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 10, 10, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:09:16,101 INFO L418 AbstractCegarLoop]: === Iteration 56 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:09:16,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:09:16,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1692637443, now seen corresponding path program 1 times [2019-10-02 09:09:16,101 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:09:16,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:09:16,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:16,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:09:16,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:09:19,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3060 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3037 trivial. 0 not checked. [2019-10-02 09:09:19,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:09:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:09:19,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:09:19,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:09:19,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:09:19,953 INFO L87 Difference]: Start difference. First operand 53120 states and 74014 transitions. Second operand 3 states. [2019-10-02 09:09:22,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:09:22,541 INFO L93 Difference]: Finished difference Result 109488 states and 153211 transitions. [2019-10-02 09:09:22,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:09:22,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 998 [2019-10-02 09:09:22,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:09:22,750 INFO L225 Difference]: With dead ends: 109488 [2019-10-02 09:09:22,750 INFO L226 Difference]: Without dead ends: 56432 [2019-10-02 09:09:22,865 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:09:22,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56432 states. [2019-10-02 09:09:25,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56432 to 53189. [2019-10-02 09:09:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53189 states. [2019-10-02 09:09:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53189 states to 53189 states and 74083 transitions. [2019-10-02 09:09:25,757 INFO L78 Accepts]: Start accepts. Automaton has 53189 states and 74083 transitions. Word has length 998 [2019-10-02 09:09:25,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:09:25,758 INFO L475 AbstractCegarLoop]: Abstraction has 53189 states and 74083 transitions. [2019-10-02 09:09:25,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:09:25,758 INFO L276 IsEmpty]: Start isEmpty. Operand 53189 states and 74083 transitions. [2019-10-02 09:09:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1007 [2019-10-02 09:09:25,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:09:25,813 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 11, 11, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:09:25,813 INFO L418 AbstractCegarLoop]: === Iteration 57 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:09:25,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:09:25,814 INFO L82 PathProgramCache]: Analyzing trace with hash -544205171, now seen corresponding path program 1 times [2019-10-02 09:09:25,814 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:09:25,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:09:25,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:25,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:09:25,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:25,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:09:26,914 INFO L134 CoverageAnalysis]: Checked inductivity of 3089 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3066 trivial. 0 not checked. [2019-10-02 09:09:26,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:09:26,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:09:26,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:09:26,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:09:26,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:09:26,916 INFO L87 Difference]: Start difference. First operand 53189 states and 74083 transitions. Second operand 3 states. [2019-10-02 09:09:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:09:29,594 INFO L93 Difference]: Finished difference Result 106516 states and 148437 transitions. [2019-10-02 09:09:29,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:09:29,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1006 [2019-10-02 09:09:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:09:30,144 INFO L225 Difference]: With dead ends: 106516 [2019-10-02 09:09:30,144 INFO L226 Difference]: Without dead ends: 53391 [2019-10-02 09:09:30,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:09:30,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53391 states. [2019-10-02 09:09:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53391 to 53257. [2019-10-02 09:09:32,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53257 states. [2019-10-02 09:09:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53257 states to 53257 states and 74151 transitions. [2019-10-02 09:09:33,021 INFO L78 Accepts]: Start accepts. Automaton has 53257 states and 74151 transitions. Word has length 1006 [2019-10-02 09:09:33,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:09:33,021 INFO L475 AbstractCegarLoop]: Abstraction has 53257 states and 74151 transitions. [2019-10-02 09:09:33,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:09:33,022 INFO L276 IsEmpty]: Start isEmpty. Operand 53257 states and 74151 transitions. [2019-10-02 09:09:33,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1006 [2019-10-02 09:09:33,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:09:33,065 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 11, 11, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:09:33,065 INFO L418 AbstractCegarLoop]: === Iteration 58 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:09:33,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:09:33,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1896325356, now seen corresponding path program 1 times [2019-10-02 09:09:33,065 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:09:33,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:09:33,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:33,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:09:33,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:09:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3088 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 3034 trivial. 0 not checked. [2019-10-02 09:09:35,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:09:35,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-10-02 09:09:35,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 09:09:35,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 09:09:35,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-10-02 09:09:35,156 INFO L87 Difference]: Start difference. First operand 53257 states and 74151 transitions. Second operand 16 states. [2019-10-02 09:09:41,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:09:41,885 INFO L93 Difference]: Finished difference Result 107597 states and 150470 transitions. [2019-10-02 09:09:41,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 09:09:41,885 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 1005 [2019-10-02 09:09:41,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:09:42,105 INFO L225 Difference]: With dead ends: 107597 [2019-10-02 09:09:42,105 INFO L226 Difference]: Without dead ends: 54404 [2019-10-02 09:09:42,219 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2019-10-02 09:09:42,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54404 states. [2019-10-02 09:09:44,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54404 to 53547. [2019-10-02 09:09:44,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53547 states. [2019-10-02 09:09:45,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53547 states to 53547 states and 74583 transitions. [2019-10-02 09:09:45,106 INFO L78 Accepts]: Start accepts. Automaton has 53547 states and 74583 transitions. Word has length 1005 [2019-10-02 09:09:45,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:09:45,107 INFO L475 AbstractCegarLoop]: Abstraction has 53547 states and 74583 transitions. [2019-10-02 09:09:45,107 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 09:09:45,107 INFO L276 IsEmpty]: Start isEmpty. Operand 53547 states and 74583 transitions. [2019-10-02 09:09:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1085 [2019-10-02 09:09:45,159 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:09:45,159 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 11, 11, 10, 10, 10, 10, 10, 10, 10, 9, 9, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:09:45,160 INFO L418 AbstractCegarLoop]: === Iteration 59 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:09:45,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:09:45,160 INFO L82 PathProgramCache]: Analyzing trace with hash 692078125, now seen corresponding path program 1 times [2019-10-02 09:09:45,160 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:09:45,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:09:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:45,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:09:45,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:09:50,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3941 backedges. 85 proven. 42 refuted. 0 times theorem prover too weak. 3814 trivial. 0 not checked. [2019-10-02 09:09:50,502 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:09:50,503 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:09:51,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:09:54,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:09:54,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 10046 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 09:09:54,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:09:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3941 backedges. 1677 proven. 8 refuted. 0 times theorem prover too weak. 2256 trivial. 0 not checked. [2019-10-02 09:09:54,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 09:09:54,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 7] total 22 [2019-10-02 09:09:54,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-02 09:09:54,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-02 09:09:54,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=415, Unknown=0, NotChecked=0, Total=462 [2019-10-02 09:09:54,919 INFO L87 Difference]: Start difference. First operand 53547 states and 74583 transitions. Second operand 22 states. [2019-10-02 09:10:01,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:10:01,761 INFO L93 Difference]: Finished difference Result 117540 states and 169699 transitions. [2019-10-02 09:10:01,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 09:10:01,761 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 1084 [2019-10-02 09:10:01,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:10:02,038 INFO L225 Difference]: With dead ends: 117540 [2019-10-02 09:10:02,038 INFO L226 Difference]: Without dead ends: 64049 [2019-10-02 09:10:02,179 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1130 GetRequests, 1099 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 09:10:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64049 states. [2019-10-02 09:10:05,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64049 to 56176. [2019-10-02 09:10:05,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56176 states. [2019-10-02 09:10:05,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56176 states to 56176 states and 78424 transitions. [2019-10-02 09:10:05,312 INFO L78 Accepts]: Start accepts. Automaton has 56176 states and 78424 transitions. Word has length 1084 [2019-10-02 09:10:05,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:10:05,313 INFO L475 AbstractCegarLoop]: Abstraction has 56176 states and 78424 transitions. [2019-10-02 09:10:05,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-02 09:10:05,313 INFO L276 IsEmpty]: Start isEmpty. Operand 56176 states and 78424 transitions. [2019-10-02 09:10:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1108 [2019-10-02 09:10:05,369 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:10:05,370 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 12, 12, 12, 12, 10, 10, 10, 10, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:10:05,370 INFO L418 AbstractCegarLoop]: === Iteration 60 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:10:05,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:10:05,371 INFO L82 PathProgramCache]: Analyzing trace with hash 590010847, now seen corresponding path program 1 times [2019-10-02 09:10:05,371 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:10:05,371 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:10:05,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:05,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:10:05,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:10:07,367 INFO L134 CoverageAnalysis]: Checked inductivity of 4314 backedges. 139 proven. 113 refuted. 0 times theorem prover too weak. 4062 trivial. 0 not checked. [2019-10-02 09:10:07,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:10:07,367 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:10:07,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:10:10,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:10:10,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 10081 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 09:10:10,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:10:11,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4314 backedges. 2157 proven. 7 refuted. 0 times theorem prover too weak. 2150 trivial. 0 not checked. [2019-10-02 09:10:11,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 09:10:11,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 5] total 21 [2019-10-02 09:10:11,658 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 09:10:11,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 09:10:11,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-10-02 09:10:11,659 INFO L87 Difference]: Start difference. First operand 56176 states and 78424 transitions. Second operand 21 states. [2019-10-02 09:10:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:10:17,316 INFO L93 Difference]: Finished difference Result 114427 states and 166927 transitions. [2019-10-02 09:10:17,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 09:10:17,317 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 1107 [2019-10-02 09:10:17,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:10:17,579 INFO L225 Difference]: With dead ends: 114427 [2019-10-02 09:10:17,579 INFO L226 Difference]: Without dead ends: 58315 [2019-10-02 09:10:17,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1141 GetRequests, 1121 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-10-02 09:10:17,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58315 states. [2019-10-02 09:10:20,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58315 to 57142. [2019-10-02 09:10:20,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57142 states. [2019-10-02 09:10:20,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57142 states to 57142 states and 79666 transitions. [2019-10-02 09:10:20,987 INFO L78 Accepts]: Start accepts. Automaton has 57142 states and 79666 transitions. Word has length 1107 [2019-10-02 09:10:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:10:20,987 INFO L475 AbstractCegarLoop]: Abstraction has 57142 states and 79666 transitions. [2019-10-02 09:10:20,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 09:10:20,987 INFO L276 IsEmpty]: Start isEmpty. Operand 57142 states and 79666 transitions. [2019-10-02 09:10:21,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1157 [2019-10-02 09:10:21,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:10:21,044 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 14, 14, 14, 14, 10, 10, 10, 10, 9, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:10:21,045 INFO L418 AbstractCegarLoop]: === Iteration 61 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:10:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:10:21,046 INFO L82 PathProgramCache]: Analyzing trace with hash 1989540977, now seen corresponding path program 1 times [2019-10-02 09:10:21,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:10:21,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:10:21,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:21,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:10:21,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:21,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:10:22,968 INFO L134 CoverageAnalysis]: Checked inductivity of 5121 backedges. 171 proven. 200 refuted. 0 times theorem prover too weak. 4750 trivial. 0 not checked. [2019-10-02 09:10:22,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:10:22,969 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:10:23,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:10:26,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:10:26,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 10189 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 09:10:26,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:10:28,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5121 backedges. 2587 proven. 42 refuted. 0 times theorem prover too weak. 2492 trivial. 0 not checked. [2019-10-02 09:10:28,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 09:10:28,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 7] total 23 [2019-10-02 09:10:28,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-02 09:10:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-02 09:10:28,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-10-02 09:10:28,191 INFO L87 Difference]: Start difference. First operand 57142 states and 79666 transitions. Second operand 23 states. [2019-10-02 09:10:34,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:10:34,418 INFO L93 Difference]: Finished difference Result 116635 states and 170921 transitions. [2019-10-02 09:10:34,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 09:10:34,419 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1156 [2019-10-02 09:10:34,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:10:34,689 INFO L225 Difference]: With dead ends: 116635 [2019-10-02 09:10:34,689 INFO L226 Difference]: Without dead ends: 59557 [2019-10-02 09:10:34,869 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1192 GetRequests, 1170 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2019-10-02 09:10:34,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59557 states. [2019-10-02 09:10:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59557 to 58108. [2019-10-02 09:10:38,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58108 states. [2019-10-02 09:10:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58108 states to 58108 states and 80908 transitions. [2019-10-02 09:10:38,979 INFO L78 Accepts]: Start accepts. Automaton has 58108 states and 80908 transitions. Word has length 1156 [2019-10-02 09:10:38,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:10:38,980 INFO L475 AbstractCegarLoop]: Abstraction has 58108 states and 80908 transitions. [2019-10-02 09:10:38,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-02 09:10:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 58108 states and 80908 transitions. [2019-10-02 09:10:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1055 [2019-10-02 09:10:39,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:10:39,045 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 10, 10, 10, 10, 10, 10, 10, 10, 10, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:10:39,045 INFO L418 AbstractCegarLoop]: === Iteration 62 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:10:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:10:39,046 INFO L82 PathProgramCache]: Analyzing trace with hash -894258091, now seen corresponding path program 2 times [2019-10-02 09:10:39,046 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:10:39,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:10:39,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:39,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:10:39,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:39,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:10:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3605 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 3533 trivial. 0 not checked. [2019-10-02 09:10:40,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:10:40,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 09:10:40,304 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 09:10:40,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 09:10:40,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 09:10:40,305 INFO L87 Difference]: Start difference. First operand 58108 states and 80908 transitions. Second operand 14 states. [2019-10-02 09:10:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:10:49,580 INFO L93 Difference]: Finished difference Result 117299 states and 163785 transitions. [2019-10-02 09:10:49,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 09:10:49,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 1054 [2019-10-02 09:10:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:10:49,773 INFO L225 Difference]: With dead ends: 117299 [2019-10-02 09:10:49,773 INFO L226 Difference]: Without dead ends: 59255 [2019-10-02 09:10:49,886 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-10-02 09:10:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59255 states. [2019-10-02 09:10:52,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59255 to 58376. [2019-10-02 09:10:52,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58376 states. [2019-10-02 09:10:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58376 states to 58376 states and 81578 transitions. [2019-10-02 09:10:52,748 INFO L78 Accepts]: Start accepts. Automaton has 58376 states and 81578 transitions. Word has length 1054 [2019-10-02 09:10:52,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:10:52,748 INFO L475 AbstractCegarLoop]: Abstraction has 58376 states and 81578 transitions. [2019-10-02 09:10:52,748 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 09:10:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 58376 states and 81578 transitions. [2019-10-02 09:10:52,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1220 [2019-10-02 09:10:52,809 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:10:52,810 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 17, 17, 17, 17, 11, 11, 10, 10, 10, 9, 9, 9, 9, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:10:52,810 INFO L418 AbstractCegarLoop]: === Iteration 63 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:10:52,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:10:52,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1702444899, now seen corresponding path program 1 times [2019-10-02 09:10:52,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:10:52,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:10:52,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:52,817 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 09:10:52,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:10:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6161 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 6105 trivial. 0 not checked. [2019-10-02 09:10:54,231 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:10:54,231 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:10:54,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:10:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:10:58,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 10389 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 09:10:58,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:10:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6161 backedges. 2744 proven. 105 refuted. 0 times theorem prover too weak. 3312 trivial. 0 not checked. [2019-10-02 09:10:59,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 09:10:59,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9] total 13 [2019-10-02 09:10:59,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 09:10:59,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 09:10:59,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-02 09:10:59,312 INFO L87 Difference]: Start difference. First operand 58376 states and 81578 transitions. Second operand 13 states. [2019-10-02 09:11:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:11:03,935 INFO L93 Difference]: Finished difference Result 120940 states and 179253 transitions. [2019-10-02 09:11:03,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 09:11:03,936 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 1219 [2019-10-02 09:11:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:11:04,195 INFO L225 Difference]: With dead ends: 120940 [2019-10-02 09:11:04,195 INFO L226 Difference]: Without dead ends: 62628 [2019-10-02 09:11:04,364 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1225 GetRequests, 1213 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-10-02 09:11:04,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62628 states. [2019-10-02 09:11:07,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62628 to 58725. [2019-10-02 09:11:07,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58725 states. [2019-10-02 09:11:07,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58725 states to 58725 states and 81663 transitions. [2019-10-02 09:11:07,693 INFO L78 Accepts]: Start accepts. Automaton has 58725 states and 81663 transitions. Word has length 1219 [2019-10-02 09:11:07,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:11:07,693 INFO L475 AbstractCegarLoop]: Abstraction has 58725 states and 81663 transitions. [2019-10-02 09:11:07,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 09:11:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 58725 states and 81663 transitions. [2019-10-02 09:11:07,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1449 [2019-10-02 09:11:07,760 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:11:07,760 INFO L411 BasicCegarLoop]: trace histogram [37, 37, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 26, 26, 26, 26, 16, 16, 14, 12, 12, 12, 10, 10, 10, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:11:07,761 INFO L418 AbstractCegarLoop]: === Iteration 64 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:11:07,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:11:07,761 INFO L82 PathProgramCache]: Analyzing trace with hash -15044630, now seen corresponding path program 1 times [2019-10-02 09:11:07,761 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:11:07,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:11:07,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:07,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:11:07,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:11:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 11603 backedges. 792 proven. 789 refuted. 0 times theorem prover too weak. 10022 trivial. 0 not checked. [2019-10-02 09:11:10,518 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:11:10,518 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:11:11,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:11:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:11:14,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 10916 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 09:11:14,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:11:15,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11603 backedges. 6039 proven. 147 refuted. 0 times theorem prover too weak. 5417 trivial. 0 not checked. [2019-10-02 09:11:15,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 09:11:15,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 10] total 31 [2019-10-02 09:11:15,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-02 09:11:15,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-02 09:11:15,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2019-10-02 09:11:15,482 INFO L87 Difference]: Start difference. First operand 58725 states and 81663 transitions. Second operand 31 states. [2019-10-02 09:11:23,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:11:23,057 INFO L93 Difference]: Finished difference Result 123368 states and 185165 transitions. [2019-10-02 09:11:23,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 09:11:23,058 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1448 [2019-10-02 09:11:23,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:11:23,386 INFO L225 Difference]: With dead ends: 123368 [2019-10-02 09:11:23,386 INFO L226 Difference]: Without dead ends: 64435 [2019-10-02 09:11:23,594 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1505 GetRequests, 1469 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=143, Invalid=1263, Unknown=0, NotChecked=0, Total=1406 [2019-10-02 09:11:23,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64435 states. [2019-10-02 09:11:31,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64435 to 61098. [2019-10-02 09:11:31,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61098 states. [2019-10-02 09:11:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61098 states to 61098 states and 84980 transitions. [2019-10-02 09:11:31,524 INFO L78 Accepts]: Start accepts. Automaton has 61098 states and 84980 transitions. Word has length 1448 [2019-10-02 09:11:31,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:11:31,525 INFO L475 AbstractCegarLoop]: Abstraction has 61098 states and 84980 transitions. [2019-10-02 09:11:31,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-02 09:11:31,525 INFO L276 IsEmpty]: Start isEmpty. Operand 61098 states and 84980 transitions. [2019-10-02 09:11:31,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1134 [2019-10-02 09:11:31,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:11:31,589 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 13, 13, 13, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:11:31,589 INFO L418 AbstractCegarLoop]: === Iteration 65 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:11:31,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:11:31,590 INFO L82 PathProgramCache]: Analyzing trace with hash 600302581, now seen corresponding path program 1 times [2019-10-02 09:11:31,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:11:31,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:11:31,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:31,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:11:31,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:11:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 4696 trivial. 0 not checked. [2019-10-02 09:11:33,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:11:33,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 09:11:33,160 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 09:11:33,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 09:11:33,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 09:11:33,160 INFO L87 Difference]: Start difference. First operand 61098 states and 84980 transitions. Second operand 12 states. [2019-10-02 09:11:39,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:11:39,099 INFO L93 Difference]: Finished difference Result 123279 states and 171927 transitions. [2019-10-02 09:11:39,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 09:11:39,100 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 1133 [2019-10-02 09:11:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:11:39,413 INFO L225 Difference]: With dead ends: 123279 [2019-10-02 09:11:39,413 INFO L226 Difference]: Without dead ends: 62245 [2019-10-02 09:11:39,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 09:11:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62245 states. [2019-10-02 09:11:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62245 to 61232. [2019-10-02 09:11:42,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61232 states. [2019-10-02 09:11:42,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61232 states to 61232 states and 85114 transitions. [2019-10-02 09:11:42,906 INFO L78 Accepts]: Start accepts. Automaton has 61232 states and 85114 transitions. Word has length 1133 [2019-10-02 09:11:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:11:42,906 INFO L475 AbstractCegarLoop]: Abstraction has 61232 states and 85114 transitions. [2019-10-02 09:11:42,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 09:11:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 61232 states and 85114 transitions. [2019-10-02 09:11:42,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1147 [2019-10-02 09:11:42,968 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:11:42,969 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 14, 14, 14, 14, 14, 14, 14, 10, 10, 10, 10, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:11:42,969 INFO L418 AbstractCegarLoop]: === Iteration 66 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:11:42,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:11:42,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1536620876, now seen corresponding path program 2 times [2019-10-02 09:11:42,970 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:11:42,970 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:11:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:42,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:11:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:43,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:11:44,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5032 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 4960 trivial. 0 not checked. [2019-10-02 09:11:44,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:11:44,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 09:11:44,633 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 09:11:44,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 09:11:44,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 09:11:44,633 INFO L87 Difference]: Start difference. First operand 61232 states and 85114 transitions. Second operand 10 states. [2019-10-02 09:11:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:11:49,579 INFO L93 Difference]: Finished difference Result 123547 states and 172197 transitions. [2019-10-02 09:11:49,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 09:11:49,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1146 [2019-10-02 09:11:49,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:11:49,863 INFO L225 Difference]: With dead ends: 123547 [2019-10-02 09:11:49,863 INFO L226 Difference]: Without dead ends: 62379 [2019-10-02 09:11:50,315 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 09:11:50,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62379 states. [2019-10-02 09:11:53,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62379 to 61500. [2019-10-02 09:11:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61500 states. [2019-10-02 09:11:53,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61500 states to 61500 states and 85382 transitions. [2019-10-02 09:11:53,626 INFO L78 Accepts]: Start accepts. Automaton has 61500 states and 85382 transitions. Word has length 1146 [2019-10-02 09:11:53,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:11:53,626 INFO L475 AbstractCegarLoop]: Abstraction has 61500 states and 85382 transitions. [2019-10-02 09:11:53,626 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 09:11:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 61500 states and 85382 transitions. [2019-10-02 09:11:53,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1416 [2019-10-02 09:11:53,693 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:11:53,694 INFO L411 BasicCegarLoop]: trace histogram [39, 39, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 25, 25, 25, 25, 16, 16, 15, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:11:53,694 INFO L418 AbstractCegarLoop]: === Iteration 67 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:11:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:11:53,695 INFO L82 PathProgramCache]: Analyzing trace with hash 774103330, now seen corresponding path program 1 times [2019-10-02 09:11:53,695 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:11:53,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:11:53,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:53,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 09:11:53,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:11:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10734 backedges. 716 proven. 438 refuted. 0 times theorem prover too weak. 9580 trivial. 0 not checked. [2019-10-02 09:11:55,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:11:55,747 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:11:56,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:11:59,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:11:59,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 10990 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 09:11:59,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:12:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10734 backedges. 5394 proven. 1 refuted. 0 times theorem prover too weak. 5339 trivial. 0 not checked. [2019-10-02 09:12:04,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 09:12:04,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 4] total 24 [2019-10-02 09:12:04,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 09:12:04,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 09:12:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2019-10-02 09:12:04,357 INFO L87 Difference]: Start difference. First operand 61500 states and 85382 transitions. Second operand 24 states. [2019-10-02 09:12:17,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:12:17,189 INFO L93 Difference]: Finished difference Result 134527 states and 203207 transitions. [2019-10-02 09:12:17,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 09:12:17,189 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1415 [2019-10-02 09:12:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:12:17,562 INFO L225 Difference]: With dead ends: 134527 [2019-10-02 09:12:17,562 INFO L226 Difference]: Without dead ends: 73091 [2019-10-02 09:12:17,779 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 1438 GetRequests, 1415 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2019-10-02 09:12:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73091 states. [2019-10-02 09:12:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73091 to 64342. [2019-10-02 09:12:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64342 states. [2019-10-02 09:12:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64342 states to 64342 states and 89907 transitions. [2019-10-02 09:12:22,224 INFO L78 Accepts]: Start accepts. Automaton has 64342 states and 89907 transitions. Word has length 1415 [2019-10-02 09:12:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:12:22,224 INFO L475 AbstractCegarLoop]: Abstraction has 64342 states and 89907 transitions. [2019-10-02 09:12:22,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 09:12:22,224 INFO L276 IsEmpty]: Start isEmpty. Operand 64342 states and 89907 transitions. [2019-10-02 09:12:22,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2815 [2019-10-02 09:12:22,327 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:12:22,328 INFO L411 BasicCegarLoop]: trace histogram [91, 91, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 71, 71, 71, 71, 48, 48, 44, 40, 27, 27, 23, 20, 20, 20, 20, 18, 16, 16, 16, 16, 15, 15, 15, 15, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:12:22,329 INFO L418 AbstractCegarLoop]: === Iteration 68 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:12:22,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:12:22,330 INFO L82 PathProgramCache]: Analyzing trace with hash 143380943, now seen corresponding path program 1 times [2019-10-02 09:12:22,330 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:12:22,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:12:22,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:12:22,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:12:22,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:12:23,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:12:28,376 INFO L134 CoverageAnalysis]: Checked inductivity of 69804 backedges. 6000 proven. 6361 refuted. 0 times theorem prover too weak. 57443 trivial. 0 not checked. [2019-10-02 09:12:28,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:12:28,377 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:12:28,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:12:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:12:33,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 15232 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 09:12:33,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:12:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 69804 backedges. 32926 proven. 385 refuted. 0 times theorem prover too weak. 36493 trivial. 0 not checked. [2019-10-02 09:12:35,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 09:12:35,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 14] total 35 [2019-10-02 09:12:35,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-02 09:12:35,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-02 09:12:35,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1034, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 09:12:35,961 INFO L87 Difference]: Start difference. First operand 64342 states and 89907 transitions. Second operand 35 states. [2019-10-02 09:12:44,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:12:44,328 INFO L93 Difference]: Finished difference Result 133341 states and 203254 transitions. [2019-10-02 09:12:44,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 09:12:44,328 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 2814 [2019-10-02 09:12:44,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:12:44,697 INFO L225 Difference]: With dead ends: 133341 [2019-10-02 09:12:44,697 INFO L226 Difference]: Without dead ends: 69063 [2019-10-02 09:12:44,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2905 GetRequests, 2865 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=195, Invalid=1527, Unknown=0, NotChecked=0, Total=1722 [2019-10-02 09:12:45,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69063 states. [2019-10-02 09:12:48,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69063 to 65308. [2019-10-02 09:12:48,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65308 states. [2019-10-02 09:12:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65308 states to 65308 states and 91149 transitions. [2019-10-02 09:12:49,157 INFO L78 Accepts]: Start accepts. Automaton has 65308 states and 91149 transitions. Word has length 2814 [2019-10-02 09:12:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:12:49,158 INFO L475 AbstractCegarLoop]: Abstraction has 65308 states and 91149 transitions. [2019-10-02 09:12:49,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-02 09:12:49,158 INFO L276 IsEmpty]: Start isEmpty. Operand 65308 states and 91149 transitions. [2019-10-02 09:12:49,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3041 [2019-10-02 09:12:49,790 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:12:49,791 INFO L411 BasicCegarLoop]: trace histogram [102, 102, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 85, 80, 80, 80, 80, 56, 56, 52, 48, 28, 28, 24, 20, 20, 20, 20, 18, 17, 17, 17, 17, 17, 17, 17, 17, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:12:49,792 INFO L418 AbstractCegarLoop]: === Iteration 69 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:12:49,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:12:49,792 INFO L82 PathProgramCache]: Analyzing trace with hash -342555840, now seen corresponding path program 1 times [2019-10-02 09:12:49,792 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:12:49,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:12:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:12:49,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:12:49,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:12:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:12:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 87174 backedges. 8790 proven. 7566 refuted. 0 times theorem prover too weak. 70818 trivial. 0 not checked. [2019-10-02 09:12:57,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:12:57,239 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:12:57,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:13:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:13:02,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 15746 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 09:13:02,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:13:05,300 INFO L134 CoverageAnalysis]: Checked inductivity of 87174 backedges. 30473 proven. 9 refuted. 0 times theorem prover too weak. 56692 trivial. 0 not checked. [2019-10-02 09:13:05,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 09:13:05,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 5] total 33 [2019-10-02 09:13:05,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-02 09:13:05,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-02 09:13:05,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=883, Unknown=0, NotChecked=0, Total=1056 [2019-10-02 09:13:05,357 INFO L87 Difference]: Start difference. First operand 65308 states and 91149 transitions. Second operand 33 states. [2019-10-02 09:13:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:13:21,461 INFO L93 Difference]: Finished difference Result 145196 states and 222582 transitions. [2019-10-02 09:13:21,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 09:13:21,461 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 3040 [2019-10-02 09:13:21,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:13:21,843 INFO L225 Difference]: With dead ends: 145196 [2019-10-02 09:13:21,843 INFO L226 Difference]: Without dead ends: 79952 [2019-10-02 09:13:22,078 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3127 GetRequests, 3095 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=177, Invalid=945, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 09:13:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79952 states. [2019-10-02 09:13:26,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79952 to 68150. [2019-10-02 09:13:26,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68150 states. [2019-10-02 09:13:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68150 states to 68150 states and 95674 transitions. [2019-10-02 09:13:26,586 INFO L78 Accepts]: Start accepts. Automaton has 68150 states and 95674 transitions. Word has length 3040 [2019-10-02 09:13:26,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:13:26,587 INFO L475 AbstractCegarLoop]: Abstraction has 68150 states and 95674 transitions. [2019-10-02 09:13:26,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-02 09:13:26,587 INFO L276 IsEmpty]: Start isEmpty. Operand 68150 states and 95674 transitions. [2019-10-02 09:13:26,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2671 [2019-10-02 09:13:26,709 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:13:26,710 INFO L411 BasicCegarLoop]: trace histogram [82, 82, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 54, 54, 54, 54, 39, 39, 38, 29, 29, 29, 29, 26, 23, 23, 23, 23, 22, 22, 22, 22, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 10, 10, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:13:26,710 INFO L418 AbstractCegarLoop]: === Iteration 70 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:13:26,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:13:26,711 INFO L82 PathProgramCache]: Analyzing trace with hash 429715280, now seen corresponding path program 1 times [2019-10-02 09:13:26,711 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:13:26,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:13:26,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:13:26,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:13:26,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:13:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat