java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 23:27:42,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 23:27:42,573 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 23:27:42,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 23:27:42,588 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 23:27:42,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 23:27:42,590 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 23:27:42,593 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 23:27:42,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 23:27:42,596 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 23:27:42,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 23:27:42,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 23:27:42,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 23:27:42,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 23:27:42,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 23:27:42,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 23:27:42,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 23:27:42,603 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 23:27:42,606 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 23:27:42,608 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 23:27:42,610 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 23:27:42,611 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 23:27:42,613 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 23:27:42,613 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 23:27:42,616 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 23:27:42,616 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 23:27:42,617 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 23:27:42,618 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 23:27:42,618 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 23:27:42,619 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 23:27:42,619 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 23:27:42,620 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 23:27:42,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 23:27:42,622 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 23:27:42,623 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 23:27:42,623 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 23:27:42,624 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 23:27:42,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 23:27:42,625 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 23:27:42,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 23:27:42,630 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 23:27:42,632 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 23:27:42,660 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 23:27:42,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 23:27:42,661 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 23:27:42,662 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 23:27:42,663 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 23:27:42,663 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 23:27:42,663 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 23:27:42,664 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 23:27:42,664 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 23:27:42,664 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 23:27:42,667 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 23:27:42,667 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 23:27:42,668 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 23:27:42,668 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 23:27:42,668 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 23:27:42,669 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 23:27:42,669 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 23:27:42,669 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 23:27:42,669 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 23:27:42,670 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 23:27:42,670 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 23:27:42,670 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 23:27:42,671 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 23:27:42,671 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 23:27:42,671 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 23:27:42,672 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 23:27:42,672 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 23:27:42,672 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 23:27:42,672 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 23:27:42,672 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 23:27:42,734 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 23:27:42,761 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 23:27:42,768 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 23:27:42,770 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 23:27:42,771 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 23:27:42,773 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i [2019-10-02 23:27:42,863 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f6cbdb9/a7f6ee4a64d441da87e1ca0a3cd3bf56/FLAG69e669d42 [2019-10-02 23:27:43,668 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 23:27:43,669 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i [2019-10-02 23:27:43,702 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f6cbdb9/a7f6ee4a64d441da87e1ca0a3cd3bf56/FLAG69e669d42 [2019-10-02 23:27:43,852 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8f6cbdb9/a7f6ee4a64d441da87e1ca0a3cd3bf56 [2019-10-02 23:27:43,864 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 23:27:43,865 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 23:27:43,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 23:27:43,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 23:27:43,870 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 23:27:43,871 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:27:43" (1/1) ... [2019-10-02 23:27:43,875 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5287bcf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:43, skipping insertion in model container [2019-10-02 23:27:43,875 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:27:43" (1/1) ... [2019-10-02 23:27:43,884 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 23:27:43,977 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 23:27:45,188 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 23:27:45,338 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 23:27:45,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 23:27:46,000 INFO L192 MainTranslator]: Completed translation [2019-10-02 23:27:46,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:46 WrapperNode [2019-10-02 23:27:46,002 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 23:27:46,003 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 23:27:46,004 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 23:27:46,004 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 23:27:46,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:46" (1/1) ... [2019-10-02 23:27:46,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:46" (1/1) ... [2019-10-02 23:27:46,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:46" (1/1) ... [2019-10-02 23:27:46,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:46" (1/1) ... [2019-10-02 23:27:46,383 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:46" (1/1) ... [2019-10-02 23:27:46,418 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:46" (1/1) ... [2019-10-02 23:27:46,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:46" (1/1) ... [2019-10-02 23:27:46,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 23:27:46,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 23:27:46,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 23:27:46,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 23:27:46,538 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 23:27:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 23:27:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 23:27:46,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-10-02 23:27:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2019-10-02 23:27:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-02 23:27:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-02 23:27:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2019-10-02 23:27:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2019-10-02 23:27:46,617 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2019-10-02 23:27:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2019-10-02 23:27:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2019-10-02 23:27:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_while_busy [2019-10-02 23:27:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_for_read [2019-10-02 23:27:46,618 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_synchronize [2019-10-02 23:27:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read [2019-10-02 23:27:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read_increment_offset [2019-10-02 23:27:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure show_value [2019-10-02 23:27:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure show_alarm [2019-10-02 23:27:46,619 INFO L138 BoogieDeclarations]: Found implementation of procedure show_mask [2019-10-02 23:27:46,622 INFO L138 BoogieDeclarations]: Found implementation of procedure show_label [2019-10-02 23:27:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure show_name [2019-10-02 23:27:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_probe [2019-10-02 23:27:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_remove [2019-10-02 23:27:46,623 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_update_device [2019-10-02 23:27:46,624 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_suspend [2019-10-02 23:27:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_resume [2019-10-02 23:27:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_dmi_detect [2019-10-02 23:27:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_detect [2019-10-02 23:27:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_init [2019-10-02 23:27:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_exit [2019-10-02 23:27:46,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 23:27:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-10-02 23:27:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-10-02 23:27:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-10-02 23:27:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-10-02 23:27:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-10-02 23:27:46,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-10-02 23:27:46,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-10-02 23:27:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-10-02 23:27:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-02 23:27:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_register_10 [2019-10-02 23:27:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_11 [2019-10-02 23:27:46,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_12 [2019-10-02 23:27:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 23:27:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 23:27:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-02 23:27:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-02 23:27:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-02 23:27:46,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-02 23:27:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-02 23:27:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-02 23:27:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-02 23:27:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-02 23:27:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-02 23:27:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-02 23:27:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-02 23:27:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-02 23:27:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-02 23:27:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-02 23:27:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-02 23:27:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru3_data [2019-10-02 23:27:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_update_lock_of_abituguru3_data [2019-10-02 23:27:46,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2019-10-02 23:27:46,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_update_lock_of_abituguru3_data [2019-10-02 23:27:46,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru3_data [2019-10-02 23:27:46,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_update_lock_of_abituguru3_data [2019-10-02 23:27:46,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2019-10-02 23:27:46,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 23:27:46,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 23:27:46,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-10-02 23:27:46,635 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-02 23:27:46,635 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-02 23:27:46,635 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2019-10-02 23:27:46,637 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2019-10-02 23:27:46,637 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kzalloc [2019-10-02 23:27:46,638 INFO L138 BoogieDeclarations]: Found implementation of procedure dmi_get_system_info [2019-10-02 23:27:46,638 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2019-10-02 23:27:46,639 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2019-10-02 23:27:46,639 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_complete_2 [2019-10-02 23:27:46,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_freeze_late_2 [2019-10-02 23:27:46,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_freeze_noirq_2 [2019-10-02 23:27:46,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_poweroff_late_2 [2019-10-02 23:27:46,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_poweroff_noirq_2 [2019-10-02 23:27:46,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_prepare_2 [2019-10-02 23:27:46,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_restore_early_2 [2019-10-02 23:27:46,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_restore_noirq_2 [2019-10-02 23:27:46,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_resume_early_2 [2019-10-02 23:27:46,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_resume_noirq_2 [2019-10-02 23:27:46,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_suspend_late_2 [2019-10-02 23:27:46,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_suspend_noirq_2 [2019-10-02 23:27:46,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_thaw_early_2 [2019-10-02 23:27:46,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_thaw_noirq_2 [2019-10-02 23:27:46,643 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2019-10-02 23:27:46,644 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-02 23:27:46,644 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-02 23:27:46,644 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 23:27:46,644 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2019-10-02 23:27:46,644 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add_resources [2019-10-02 23:27:46,644 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2019-10-02 23:27:46,645 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_put [2019-10-02 23:27:46,645 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2019-10-02 23:27:46,645 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_register [2019-10-02 23:27:46,645 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2019-10-02 23:27:46,645 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2019-10-02 23:27:46,645 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 23:27:46,646 INFO L138 BoogieDeclarations]: Found implementation of procedure strncasecmp [2019-10-02 23:27:46,646 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 23:27:46,646 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 23:27:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 23:27:46,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 23:27:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 23:27:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 23:27:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-10-02 23:27:46,647 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-02 23:27:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-10-02 23:27:46,648 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-10-02 23:27:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-10-02 23:27:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-10-02 23:27:46,649 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2019-10-02 23:27:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-10-02 23:27:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 23:27:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-02 23:27:46,650 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-02 23:27:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-10-02 23:27:46,651 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-02 23:27:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-10-02 23:27:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 23:27:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-10-02 23:27:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-10-02 23:27:46,652 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-10-02 23:27:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-02 23:27:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-02 23:27:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-10-02 23:27:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-10-02 23:27:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-10-02 23:27:46,653 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-10-02 23:27:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-02 23:27:46,654 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-02 23:27:46,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-02 23:27:46,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-02 23:27:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-02 23:27:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2019-10-02 23:27:46,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2019-10-02 23:27:46,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 23:27:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2019-10-02 23:27:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2019-10-02 23:27:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2019-10-02 23:27:46,666 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2019-10-02 23:27:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2019-10-02 23:27:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2019-10-02 23:27:46,667 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kzalloc [2019-10-02 23:27:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-02 23:27:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-02 23:27:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2019-10-02 23:27:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2019-10-02 23:27:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2019-10-02 23:27:46,668 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add_resources [2019-10-02 23:27:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2019-10-02 23:27:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_put [2019-10-02 23:27:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_register [2019-10-02 23:27:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_register_10 [2019-10-02 23:27:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2019-10-02 23:27:46,669 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_11 [2019-10-02 23:27:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_12 [2019-10-02 23:27:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2019-10-02 23:27:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2019-10-02 23:27:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2019-10-02 23:27:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2019-10-02 23:27:46,670 INFO L130 BoogieDeclarations]: Found specification of procedure dmi_get_system_info [2019-10-02 23:27:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_while_busy [2019-10-02 23:27:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 23:27:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_for_read [2019-10-02 23:27:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_synchronize [2019-10-02 23:27:46,671 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read [2019-10-02 23:27:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 23:27:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read_increment_offset [2019-10-02 23:27:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_update_device [2019-10-02 23:27:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure show_value [2019-10-02 23:27:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure show_alarm [2019-10-02 23:27:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure show_mask [2019-10-02 23:27:46,672 INFO L130 BoogieDeclarations]: Found specification of procedure show_label [2019-10-02 23:27:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure show_name [2019-10-02 23:27:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_probe [2019-10-02 23:27:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 23:27:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 23:27:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_remove [2019-10-02 23:27:46,673 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_suspend [2019-10-02 23:27:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_resume [2019-10-02 23:27:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_dmi_detect [2019-10-02 23:27:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_detect [2019-10-02 23:27:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_init [2019-10-02 23:27:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_exit [2019-10-02 23:27:46,674 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_resume_noirq_2 [2019-10-02 23:27:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_poweroff_noirq_2 [2019-10-02 23:27:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_freeze_noirq_2 [2019-10-02 23:27:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_complete_2 [2019-10-02 23:27:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_freeze_late_2 [2019-10-02 23:27:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_suspend_late_2 [2019-10-02 23:27:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_resume_early_2 [2019-10-02 23:27:46,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_suspend_noirq_2 [2019-10-02 23:27:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_thaw_early_2 [2019-10-02 23:27:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 23:27:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_poweroff_late_2 [2019-10-02 23:27:46,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_thaw_noirq_2 [2019-10-02 23:27:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 23:27:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_prepare_2 [2019-10-02 23:27:46,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_restore_noirq_2 [2019-10-02 23:27:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_restore_early_2 [2019-10-02 23:27:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 23:27:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 23:27:46,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-02 23:27:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-02 23:27:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-02 23:27:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-02 23:27:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-02 23:27:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-02 23:27:46,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-02 23:27:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-02 23:27:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-02 23:27:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-02 23:27:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru3_data [2019-10-02 23:27:46,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_update_lock_of_abituguru3_data [2019-10-02 23:27:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_update_lock_of_abituguru3_data [2019-10-02 23:27:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru3_data [2019-10-02 23:27:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_update_lock_of_abituguru3_data [2019-10-02 23:27:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 23:27:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 23:27:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 23:27:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 23:27:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 23:27:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 23:27:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 23:27:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 23:28:34,668 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 23:28:34,668 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 23:28:34,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:28:34 BoogieIcfgContainer [2019-10-02 23:28:34,671 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 23:28:34,673 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 23:28:34,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 23:28:34,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 23:28:34,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:27:43" (1/3) ... [2019-10-02 23:28:34,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7681e681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:28:34, skipping insertion in model container [2019-10-02 23:28:34,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:46" (2/3) ... [2019-10-02 23:28:34,680 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7681e681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:28:34, skipping insertion in model container [2019-10-02 23:28:34,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:28:34" (3/3) ... [2019-10-02 23:28:34,683 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i [2019-10-02 23:28:34,694 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 23:28:34,709 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 23:28:34,729 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 23:28:34,763 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 23:28:34,763 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 23:28:34,763 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 23:28:34,763 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 23:28:34,763 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 23:28:34,764 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 23:28:34,764 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 23:28:34,764 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 23:28:34,809 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states. [2019-10-02 23:28:34,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-02 23:28:34,834 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:28:34,835 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 23:28:34,840 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:28:34,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:28:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash 607430032, now seen corresponding path program 1 times [2019-10-02 23:28:34,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:28:34,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:28:34,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:28:34,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:28:34,960 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:28:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:28:37,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:28:37,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:28:37,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:28:37,305 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:28:37,312 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:28:37,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:28:37,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:28:37,332 INFO L87 Difference]: Start difference. First operand 777 states. Second operand 3 states. [2019-10-02 23:30:08,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:30:08,244 INFO L93 Difference]: Finished difference Result 1172 states and 1531 transitions. [2019-10-02 23:30:08,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:30:08,247 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-02 23:30:08,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:30:08,293 INFO L225 Difference]: With dead ends: 1172 [2019-10-02 23:30:08,294 INFO L226 Difference]: Without dead ends: 1158 [2019-10-02 23:30:08,298 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:30:08,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-10-02 23:30:08,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1146. [2019-10-02 23:30:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2019-10-02 23:30:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1504 transitions. [2019-10-02 23:30:08,510 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1504 transitions. Word has length 41 [2019-10-02 23:30:08,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:30:08,510 INFO L475 AbstractCegarLoop]: Abstraction has 1146 states and 1504 transitions. [2019-10-02 23:30:08,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:30:08,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1504 transitions. [2019-10-02 23:30:08,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-02 23:30:08,520 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:30:08,521 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] [2019-10-02 23:30:08,521 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:30:08,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:30:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash 966365340, now seen corresponding path program 1 times [2019-10-02 23:30:08,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:30:08,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:08,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:30:08,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:08,537 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:30:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:30:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:30:09,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:30:09,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:30:09,706 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:30:09,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:30:09,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:30:09,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:30:09,712 INFO L87 Difference]: Start difference. First operand 1146 states and 1504 transitions. Second operand 3 states. [2019-10-02 23:30:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:30:14,280 INFO L93 Difference]: Finished difference Result 2040 states and 2691 transitions. [2019-10-02 23:30:14,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:30:14,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-02 23:30:14,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:30:14,303 INFO L225 Difference]: With dead ends: 2040 [2019-10-02 23:30:14,303 INFO L226 Difference]: Without dead ends: 2040 [2019-10-02 23:30:14,304 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:30:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2019-10-02 23:30:14,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 2020. [2019-10-02 23:30:14,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-10-02 23:30:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2672 transitions. [2019-10-02 23:30:14,400 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2672 transitions. Word has length 38 [2019-10-02 23:30:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:30:14,400 INFO L475 AbstractCegarLoop]: Abstraction has 2020 states and 2672 transitions. [2019-10-02 23:30:14,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:30:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2672 transitions. [2019-10-02 23:30:14,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 23:30:14,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:30:14,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:30:14,406 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:30:14,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:30:14,406 INFO L82 PathProgramCache]: Analyzing trace with hash 98737886, now seen corresponding path program 1 times [2019-10-02 23:30:14,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:30:14,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:14,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:30:14,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:14,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:30:14,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:30:16,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:30:16,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:30:16,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 23:30:16,930 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:30:16,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 23:30:16,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 23:30:16,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:30:16,932 INFO L87 Difference]: Start difference. First operand 2020 states and 2672 transitions. Second operand 7 states. [2019-10-02 23:30:17,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:30:17,151 INFO L93 Difference]: Finished difference Result 2094 states and 2772 transitions. [2019-10-02 23:30:17,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 23:30:17,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-10-02 23:30:17,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:30:17,166 INFO L225 Difference]: With dead ends: 2094 [2019-10-02 23:30:17,166 INFO L226 Difference]: Without dead ends: 2094 [2019-10-02 23:30:17,167 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-10-02 23:30:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2019-10-02 23:30:17,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2046. [2019-10-02 23:30:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-10-02 23:30:17,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2708 transitions. [2019-10-02 23:30:17,266 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2708 transitions. Word has length 48 [2019-10-02 23:30:17,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:30:17,267 INFO L475 AbstractCegarLoop]: Abstraction has 2046 states and 2708 transitions. [2019-10-02 23:30:17,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 23:30:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2708 transitions. [2019-10-02 23:30:17,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 23:30:17,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:30:17,270 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:30:17,270 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:30:17,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:30:17,270 INFO L82 PathProgramCache]: Analyzing trace with hash 160777500, now seen corresponding path program 1 times [2019-10-02 23:30:17,271 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:30:17,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:17,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:30:17,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:17,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:30:17,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:30:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:30:18,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:30:18,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:30:18,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:30:18,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:30:18,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:30:18,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:30:18,355 INFO L87 Difference]: Start difference. First operand 2046 states and 2708 transitions. Second operand 3 states. [2019-10-02 23:30:34,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:30:34,008 INFO L93 Difference]: Finished difference Result 2055 states and 2717 transitions. [2019-10-02 23:30:34,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:30:34,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-02 23:30:34,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:30:34,033 INFO L225 Difference]: With dead ends: 2055 [2019-10-02 23:30:34,033 INFO L226 Difference]: Without dead ends: 2055 [2019-10-02 23:30:34,034 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:30:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2019-10-02 23:30:34,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 2046. [2019-10-02 23:30:34,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-10-02 23:30:34,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2707 transitions. [2019-10-02 23:30:34,121 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2707 transitions. Word has length 48 [2019-10-02 23:30:34,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:30:34,124 INFO L475 AbstractCegarLoop]: Abstraction has 2046 states and 2707 transitions. [2019-10-02 23:30:34,124 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:30:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2707 transitions. [2019-10-02 23:30:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 23:30:34,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:30:34,126 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:30:34,126 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:30:34,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:30:34,126 INFO L82 PathProgramCache]: Analyzing trace with hash 218035802, now seen corresponding path program 1 times [2019-10-02 23:30:34,126 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:30:34,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:34,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:30:34,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:34,142 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:30:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:30:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:30:35,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:30:35,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:30:35,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:30:35,024 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:30:35,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:30:35,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:30:35,026 INFO L87 Difference]: Start difference. First operand 2046 states and 2707 transitions. Second operand 3 states. [2019-10-02 23:30:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:30:44,859 INFO L93 Difference]: Finished difference Result 2045 states and 2705 transitions. [2019-10-02 23:30:44,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:30:44,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-02 23:30:44,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:30:44,873 INFO L225 Difference]: With dead ends: 2045 [2019-10-02 23:30:44,873 INFO L226 Difference]: Without dead ends: 2045 [2019-10-02 23:30:44,874 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:30:44,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2019-10-02 23:30:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 2045. [2019-10-02 23:30:44,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-10-02 23:30:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2705 transitions. [2019-10-02 23:30:44,953 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2705 transitions. Word has length 48 [2019-10-02 23:30:44,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:30:44,954 INFO L475 AbstractCegarLoop]: Abstraction has 2045 states and 2705 transitions. [2019-10-02 23:30:44,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:30:44,954 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2705 transitions. [2019-10-02 23:30:44,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-02 23:30:44,956 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:30:44,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:30:44,957 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:30:44,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:30:44,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1831202699, now seen corresponding path program 1 times [2019-10-02 23:30:44,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:30:44,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:44,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:30:44,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:44,971 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:30:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:30:45,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:30:45,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:30:45,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:30:45,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:30:45,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:30:45,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:30:45,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:30:45,874 INFO L87 Difference]: Start difference. First operand 2045 states and 2705 transitions. Second operand 3 states. [2019-10-02 23:30:56,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:30:56,655 INFO L93 Difference]: Finished difference Result 2044 states and 2703 transitions. [2019-10-02 23:30:56,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:30:56,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-02 23:30:56,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:30:56,674 INFO L225 Difference]: With dead ends: 2044 [2019-10-02 23:30:56,674 INFO L226 Difference]: Without dead ends: 2044 [2019-10-02 23:30:56,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:30:56,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-10-02 23:30:56,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2019-10-02 23:30:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-10-02 23:30:56,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2703 transitions. [2019-10-02 23:30:56,739 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2703 transitions. Word has length 49 [2019-10-02 23:30:56,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:30:56,741 INFO L475 AbstractCegarLoop]: Abstraction has 2044 states and 2703 transitions. [2019-10-02 23:30:56,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:30:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2703 transitions. [2019-10-02 23:30:56,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-02 23:30:56,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:30:56,743 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:30:56,743 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:30:56,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:30:56,743 INFO L82 PathProgramCache]: Analyzing trace with hash -933081923, now seen corresponding path program 1 times [2019-10-02 23:30:56,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:30:56,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:56,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:30:56,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:30:56,755 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:30:57,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:30:57,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:30:57,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:30:57,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:30:57,616 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:30:57,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:30:57,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:30:57,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:30:57,618 INFO L87 Difference]: Start difference. First operand 2044 states and 2703 transitions. Second operand 3 states. [2019-10-02 23:31:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:31:11,604 INFO L93 Difference]: Finished difference Result 3595 states and 4770 transitions. [2019-10-02 23:31:11,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:31:11,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-02 23:31:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:31:11,627 INFO L225 Difference]: With dead ends: 3595 [2019-10-02 23:31:11,628 INFO L226 Difference]: Without dead ends: 3574 [2019-10-02 23:31:11,628 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:31:11,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-10-02 23:31:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3565. [2019-10-02 23:31:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3565 states. [2019-10-02 23:31:11,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4738 transitions. [2019-10-02 23:31:11,933 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4738 transitions. Word has length 50 [2019-10-02 23:31:11,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:31:11,933 INFO L475 AbstractCegarLoop]: Abstraction has 3565 states and 4738 transitions. [2019-10-02 23:31:11,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:31:11,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4738 transitions. [2019-10-02 23:31:11,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-02 23:31:11,937 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:31:11,937 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:31:11,937 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:31:11,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:31:11,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2092356603, now seen corresponding path program 1 times [2019-10-02 23:31:11,938 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:31:11,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:31:11,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:31:11,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:31:11,949 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:31:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:31:12,789 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 23:31:12,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:31:12,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:31:12,790 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:31:12,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:31:12,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:31:12,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:31:12,791 INFO L87 Difference]: Start difference. First operand 3565 states and 4738 transitions. Second operand 3 states. [2019-10-02 23:31:28,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:31:28,284 INFO L93 Difference]: Finished difference Result 5213 states and 6923 transitions. [2019-10-02 23:31:28,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:31:28,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-10-02 23:31:28,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:31:28,316 INFO L225 Difference]: With dead ends: 5213 [2019-10-02 23:31:28,317 INFO L226 Difference]: Without dead ends: 5213 [2019-10-02 23:31:28,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:31:28,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5213 states. [2019-10-02 23:31:28,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5213 to 5187. [2019-10-02 23:31:28,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5187 states. [2019-10-02 23:31:28,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 6898 transitions. [2019-10-02 23:31:28,468 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 6898 transitions. Word has length 71 [2019-10-02 23:31:28,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:31:28,470 INFO L475 AbstractCegarLoop]: Abstraction has 5187 states and 6898 transitions. [2019-10-02 23:31:28,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:31:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 6898 transitions. [2019-10-02 23:31:28,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 23:31:28,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:31:28,475 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:31:28,475 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:31:28,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:31:28,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1745715627, now seen corresponding path program 1 times [2019-10-02 23:31:28,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:31:28,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:31:28,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:31:28,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:31:28,485 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:31:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:31:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 23:31:29,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:31:29,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:31:29,272 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:31:29,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:31:29,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:31:29,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:31:29,275 INFO L87 Difference]: Start difference. First operand 5187 states and 6898 transitions. Second operand 3 states. [2019-10-02 23:31:43,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:31:43,801 INFO L93 Difference]: Finished difference Result 6835 states and 9083 transitions. [2019-10-02 23:31:43,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:31:43,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-10-02 23:31:43,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:31:43,857 INFO L225 Difference]: With dead ends: 6835 [2019-10-02 23:31:43,858 INFO L226 Difference]: Without dead ends: 6835 [2019-10-02 23:31:43,864 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:31:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2019-10-02 23:31:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 6809. [2019-10-02 23:31:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6809 states. [2019-10-02 23:31:44,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6809 states to 6809 states and 9058 transitions. [2019-10-02 23:31:44,086 INFO L78 Accepts]: Start accepts. Automaton has 6809 states and 9058 transitions. Word has length 96 [2019-10-02 23:31:44,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:31:44,088 INFO L475 AbstractCegarLoop]: Abstraction has 6809 states and 9058 transitions. [2019-10-02 23:31:44,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:31:44,088 INFO L276 IsEmpty]: Start isEmpty. Operand 6809 states and 9058 transitions. [2019-10-02 23:31:44,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 23:31:44,099 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:31:44,099 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:31:44,100 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:31:44,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:31:44,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1060927206, now seen corresponding path program 1 times [2019-10-02 23:31:44,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:31:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:31:44,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:31:44,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:31:44,111 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:31:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:31:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-02 23:31:44,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:31:44,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:31:44,887 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:31:44,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:31:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:31:44,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:31:44,889 INFO L87 Difference]: Start difference. First operand 6809 states and 9058 transitions. Second operand 3 states. [2019-10-02 23:31:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:31:58,904 INFO L93 Difference]: Finished difference Result 8938 states and 11966 transitions. [2019-10-02 23:31:58,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:31:58,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-02 23:31:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:31:58,945 INFO L225 Difference]: With dead ends: 8938 [2019-10-02 23:31:58,945 INFO L226 Difference]: Without dead ends: 8938 [2019-10-02 23:31:58,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:31:58,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8938 states. [2019-10-02 23:31:59,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8938 to 8855. [2019-10-02 23:31:59,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8855 states. [2019-10-02 23:31:59,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8855 states to 8855 states and 11874 transitions. [2019-10-02 23:31:59,169 INFO L78 Accepts]: Start accepts. Automaton has 8855 states and 11874 transitions. Word has length 130 [2019-10-02 23:31:59,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:31:59,169 INFO L475 AbstractCegarLoop]: Abstraction has 8855 states and 11874 transitions. [2019-10-02 23:31:59,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:31:59,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8855 states and 11874 transitions. [2019-10-02 23:31:59,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 23:31:59,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:31:59,180 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:31:59,180 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:31:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:31:59,180 INFO L82 PathProgramCache]: Analyzing trace with hash -516794013, now seen corresponding path program 1 times [2019-10-02 23:31:59,181 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:31:59,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:31:59,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:31:59,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:31:59,190 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:31:59,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:32:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 23:32:00,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:32:00,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:32:00,290 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:32:00,290 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:32:00,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:32:00,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:32:00,291 INFO L87 Difference]: Start difference. First operand 8855 states and 11874 transitions. Second operand 3 states. [2019-10-02 23:32:13,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:32:13,784 INFO L93 Difference]: Finished difference Result 10923 states and 14649 transitions. [2019-10-02 23:32:13,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:32:13,785 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-02 23:32:13,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:32:13,844 INFO L225 Difference]: With dead ends: 10923 [2019-10-02 23:32:13,845 INFO L226 Difference]: Without dead ends: 10923 [2019-10-02 23:32:13,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:32:13,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10923 states. [2019-10-02 23:32:14,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10923 to 10897. [2019-10-02 23:32:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10897 states. [2019-10-02 23:32:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10897 states to 10897 states and 14624 transitions. [2019-10-02 23:32:14,109 INFO L78 Accepts]: Start accepts. Automaton has 10897 states and 14624 transitions. Word has length 141 [2019-10-02 23:32:14,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:32:14,109 INFO L475 AbstractCegarLoop]: Abstraction has 10897 states and 14624 transitions. [2019-10-02 23:32:14,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:32:14,109 INFO L276 IsEmpty]: Start isEmpty. Operand 10897 states and 14624 transitions. [2019-10-02 23:32:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 23:32:14,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:32:14,122 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:32:14,123 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:32:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:32:14,123 INFO L82 PathProgramCache]: Analyzing trace with hash -226042026, now seen corresponding path program 1 times [2019-10-02 23:32:14,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:32:14,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:32:14,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:32:14,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:32:14,131 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:32:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:32:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 23:32:14,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:32:14,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:32:14,999 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:32:15,000 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:32:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:32:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:32:15,002 INFO L87 Difference]: Start difference. First operand 10897 states and 14624 transitions. Second operand 3 states. [2019-10-02 23:32:32,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:32:32,167 INFO L93 Difference]: Finished difference Result 12965 states and 17399 transitions. [2019-10-02 23:32:32,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:32:32,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-02 23:32:32,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:32:32,220 INFO L225 Difference]: With dead ends: 12965 [2019-10-02 23:32:32,220 INFO L226 Difference]: Without dead ends: 12965 [2019-10-02 23:32:32,221 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:32:32,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12965 states. [2019-10-02 23:32:32,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12965 to 12939. [2019-10-02 23:32:32,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12939 states. [2019-10-02 23:32:32,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12939 states to 12939 states and 17374 transitions. [2019-10-02 23:32:32,507 INFO L78 Accepts]: Start accepts. Automaton has 12939 states and 17374 transitions. Word has length 140 [2019-10-02 23:32:32,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:32:32,507 INFO L475 AbstractCegarLoop]: Abstraction has 12939 states and 17374 transitions. [2019-10-02 23:32:32,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:32:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 12939 states and 17374 transitions. [2019-10-02 23:32:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 23:32:32,517 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:32:32,518 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:32:32,518 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:32:32,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:32:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1539440769, now seen corresponding path program 1 times [2019-10-02 23:32:32,519 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:32:32,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:32:32,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:32:32,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:32:32,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:32:32,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:32:33,358 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 23:32:33,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:32:33,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:32:33,359 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:32:33,359 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:32:33,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:32:33,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:32:33,360 INFO L87 Difference]: Start difference. First operand 12939 states and 17374 transitions. Second operand 3 states. [2019-10-02 23:32:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:32:46,968 INFO L93 Difference]: Finished difference Result 15007 states and 20149 transitions. [2019-10-02 23:32:46,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:32:46,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-02 23:32:46,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:32:47,027 INFO L225 Difference]: With dead ends: 15007 [2019-10-02 23:32:47,028 INFO L226 Difference]: Without dead ends: 15007 [2019-10-02 23:32:47,029 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:32:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15007 states. [2019-10-02 23:32:47,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15007 to 14981. [2019-10-02 23:32:47,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-10-02 23:32:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 20124 transitions. [2019-10-02 23:32:47,541 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 20124 transitions. Word has length 142 [2019-10-02 23:32:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:32:47,541 INFO L475 AbstractCegarLoop]: Abstraction has 14981 states and 20124 transitions. [2019-10-02 23:32:47,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:32:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 20124 transitions. [2019-10-02 23:32:47,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 23:32:47,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:32:47,558 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:32:47,558 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:32:47,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:32:47,559 INFO L82 PathProgramCache]: Analyzing trace with hash 764482216, now seen corresponding path program 1 times [2019-10-02 23:32:47,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:32:47,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:32:47,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:32:47,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:32:47,569 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:32:47,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:32:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 23:32:48,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:32:48,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:32:48,436 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:32:48,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:32:48,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:32:48,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:32:48,437 INFO L87 Difference]: Start difference. First operand 14981 states and 20124 transitions. Second operand 5 states. [2019-10-02 23:33:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:33:01,121 INFO L93 Difference]: Finished difference Result 14981 states and 20120 transitions. [2019-10-02 23:33:01,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:33:01,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-10-02 23:33:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:33:01,184 INFO L225 Difference]: With dead ends: 14981 [2019-10-02 23:33:01,184 INFO L226 Difference]: Without dead ends: 14981 [2019-10-02 23:33:01,185 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:33:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14981 states. [2019-10-02 23:33:01,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14981 to 14981. [2019-10-02 23:33:01,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-10-02 23:33:01,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 20120 transitions. [2019-10-02 23:33:01,491 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 20120 transitions. Word has length 140 [2019-10-02 23:33:01,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:33:01,492 INFO L475 AbstractCegarLoop]: Abstraction has 14981 states and 20120 transitions. [2019-10-02 23:33:01,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:33:01,492 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 20120 transitions. [2019-10-02 23:33:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 23:33:01,502 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:33:01,502 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:33:01,502 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:33:01,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:33:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash -991230631, now seen corresponding path program 1 times [2019-10-02 23:33:01,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:33:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:01,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:33:01,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:01,513 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:33:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:33:02,433 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 23:33:02,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:33:02,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:33:02,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:33:02,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:33:02,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:33:02,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:33:02,436 INFO L87 Difference]: Start difference. First operand 14981 states and 20120 transitions. Second operand 5 states. [2019-10-02 23:33:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:33:15,625 INFO L93 Difference]: Finished difference Result 14981 states and 20116 transitions. [2019-10-02 23:33:15,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:33:15,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-02 23:33:15,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:33:15,684 INFO L225 Difference]: With dead ends: 14981 [2019-10-02 23:33:15,685 INFO L226 Difference]: Without dead ends: 14981 [2019-10-02 23:33:15,685 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:33:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14981 states. [2019-10-02 23:33:15,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14981 to 14981. [2019-10-02 23:33:15,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-10-02 23:33:16,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 20116 transitions. [2019-10-02 23:33:16,019 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 20116 transitions. Word has length 139 [2019-10-02 23:33:16,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:33:16,020 INFO L475 AbstractCegarLoop]: Abstraction has 14981 states and 20116 transitions. [2019-10-02 23:33:16,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:33:16,020 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 20116 transitions. [2019-10-02 23:33:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 23:33:16,030 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:33:16,030 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:33:16,030 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:33:16,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:33:16,031 INFO L82 PathProgramCache]: Analyzing trace with hash -963926589, now seen corresponding path program 1 times [2019-10-02 23:33:16,031 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:33:16,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:16,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:33:16,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:16,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:33:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:33:18,431 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 23:33:18,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:33:18,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:33:18,435 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:33:18,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:33:18,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:33:18,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:33:18,437 INFO L87 Difference]: Start difference. First operand 14981 states and 20116 transitions. Second operand 5 states. [2019-10-02 23:33:30,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:33:30,477 INFO L93 Difference]: Finished difference Result 14981 states and 20112 transitions. [2019-10-02 23:33:30,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:33:30,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-02 23:33:30,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:33:30,530 INFO L225 Difference]: With dead ends: 14981 [2019-10-02 23:33:30,531 INFO L226 Difference]: Without dead ends: 14981 [2019-10-02 23:33:30,531 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:33:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14981 states. [2019-10-02 23:33:30,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14981 to 14981. [2019-10-02 23:33:30,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-10-02 23:33:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 20112 transitions. [2019-10-02 23:33:30,832 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 20112 transitions. Word has length 138 [2019-10-02 23:33:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:33:30,833 INFO L475 AbstractCegarLoop]: Abstraction has 14981 states and 20112 transitions. [2019-10-02 23:33:30,833 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:33:30,833 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 20112 transitions. [2019-10-02 23:33:30,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 23:33:30,842 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:33:30,842 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] [2019-10-02 23:33:30,843 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:33:30,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:33:30,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1095695836, now seen corresponding path program 1 times [2019-10-02 23:33:30,843 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:33:30,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:30,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:33:30,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:30,851 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:33:31,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:33:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 23:33:31,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:33:31,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 23:33:31,671 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:33:31,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 23:33:31,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 23:33:31,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 23:33:31,672 INFO L87 Difference]: Start difference. First operand 14981 states and 20112 transitions. Second operand 10 states. [2019-10-02 23:33:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:33:46,278 INFO L93 Difference]: Finished difference Result 15856 states and 21168 transitions. [2019-10-02 23:33:46,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 23:33:46,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 138 [2019-10-02 23:33:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:33:46,343 INFO L225 Difference]: With dead ends: 15856 [2019-10-02 23:33:46,343 INFO L226 Difference]: Without dead ends: 15730 [2019-10-02 23:33:46,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-10-02 23:33:46,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15730 states. [2019-10-02 23:33:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15730 to 15068. [2019-10-02 23:33:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15068 states. [2019-10-02 23:33:46,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15068 states to 15068 states and 20157 transitions. [2019-10-02 23:33:46,722 INFO L78 Accepts]: Start accepts. Automaton has 15068 states and 20157 transitions. Word has length 138 [2019-10-02 23:33:46,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:33:46,722 INFO L475 AbstractCegarLoop]: Abstraction has 15068 states and 20157 transitions. [2019-10-02 23:33:46,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 23:33:46,723 INFO L276 IsEmpty]: Start isEmpty. Operand 15068 states and 20157 transitions. [2019-10-02 23:33:46,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 23:33:46,732 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:33:46,732 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:33:46,733 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:33:46,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:33:46,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1653887178, now seen corresponding path program 1 times [2019-10-02 23:33:46,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:33:46,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:46,742 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:33:46,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:46,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:33:47,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:33:47,658 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 23:33:47,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:33:47,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:33:47,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:33:47,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:33:47,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:33:47,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:33:47,661 INFO L87 Difference]: Start difference. First operand 15068 states and 20157 transitions. Second operand 5 states. [2019-10-02 23:33:47,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:33:47,807 INFO L93 Difference]: Finished difference Result 15096 states and 20143 transitions. [2019-10-02 23:33:47,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:33:47,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 167 [2019-10-02 23:33:47,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:33:47,868 INFO L225 Difference]: With dead ends: 15096 [2019-10-02 23:33:47,868 INFO L226 Difference]: Without dead ends: 15096 [2019-10-02 23:33:47,869 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:33:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15096 states. [2019-10-02 23:33:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15096 to 15026. [2019-10-02 23:33:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15026 states. [2019-10-02 23:33:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15026 states to 15026 states and 20059 transitions. [2019-10-02 23:33:48,412 INFO L78 Accepts]: Start accepts. Automaton has 15026 states and 20059 transitions. Word has length 167 [2019-10-02 23:33:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:33:48,412 INFO L475 AbstractCegarLoop]: Abstraction has 15026 states and 20059 transitions. [2019-10-02 23:33:48,412 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:33:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 15026 states and 20059 transitions. [2019-10-02 23:33:48,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 23:33:48,422 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:33:48,422 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:33:48,422 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:33:48,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:33:48,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1550213977, now seen corresponding path program 1 times [2019-10-02 23:33:48,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:33:48,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:48,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:33:48,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:48,433 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:33:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:33:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 23:33:49,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:33:49,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:33:49,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:33:49,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:33:49,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:33:49,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:33:49,234 INFO L87 Difference]: Start difference. First operand 15026 states and 20059 transitions. Second operand 5 states. [2019-10-02 23:33:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:33:49,363 INFO L93 Difference]: Finished difference Result 15194 states and 20255 transitions. [2019-10-02 23:33:49,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:33:49,363 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 186 [2019-10-02 23:33:49,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:33:49,431 INFO L225 Difference]: With dead ends: 15194 [2019-10-02 23:33:49,431 INFO L226 Difference]: Without dead ends: 15194 [2019-10-02 23:33:49,432 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:33:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15194 states. [2019-10-02 23:33:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15194 to 15110. [2019-10-02 23:33:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15110 states. [2019-10-02 23:33:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15110 states to 15110 states and 20143 transitions. [2019-10-02 23:33:49,756 INFO L78 Accepts]: Start accepts. Automaton has 15110 states and 20143 transitions. Word has length 186 [2019-10-02 23:33:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:33:49,757 INFO L475 AbstractCegarLoop]: Abstraction has 15110 states and 20143 transitions. [2019-10-02 23:33:49,757 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:33:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 15110 states and 20143 transitions. [2019-10-02 23:33:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 23:33:49,769 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:33:49,770 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:33:49,770 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:33:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:33:49,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1746018369, now seen corresponding path program 1 times [2019-10-02 23:33:49,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:33:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:49,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:33:49,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:33:49,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:33:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:33:50,561 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 23:33:50,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:33:50,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:33:50,562 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:33:50,563 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:33:50,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:33:50,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:33:50,564 INFO L87 Difference]: Start difference. First operand 15110 states and 20143 transitions. Second operand 4 states. [2019-10-02 23:34:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:34:09,738 INFO L93 Difference]: Finished difference Result 29582 states and 39286 transitions. [2019-10-02 23:34:09,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 23:34:09,739 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 187 [2019-10-02 23:34:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:34:09,856 INFO L225 Difference]: With dead ends: 29582 [2019-10-02 23:34:09,857 INFO L226 Difference]: Without dead ends: 29582 [2019-10-02 23:34:09,857 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:34:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29582 states. [2019-10-02 23:34:10,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29582 to 29537. [2019-10-02 23:34:10,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29537 states. [2019-10-02 23:34:10,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29537 states to 29537 states and 39242 transitions. [2019-10-02 23:34:10,811 INFO L78 Accepts]: Start accepts. Automaton has 29537 states and 39242 transitions. Word has length 187 [2019-10-02 23:34:10,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:34:10,811 INFO L475 AbstractCegarLoop]: Abstraction has 29537 states and 39242 transitions. [2019-10-02 23:34:10,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:34:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 29537 states and 39242 transitions. [2019-10-02 23:34:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 23:34:10,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:34:10,831 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:34:10,832 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:34:10,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:34:10,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1373235905, now seen corresponding path program 1 times [2019-10-02 23:34:10,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:34:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:34:10,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:34:10,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:34:10,845 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:34:11,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:34:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 23:34:11,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:34:11,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 23:34:11,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:34:11,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 23:34:11,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 23:34:11,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 23:34:11,668 INFO L87 Difference]: Start difference. First operand 29537 states and 39242 transitions. Second operand 6 states. [2019-10-02 23:34:54,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:34:54,853 INFO L93 Difference]: Finished difference Result 18314 states and 23654 transitions. [2019-10-02 23:34:54,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 23:34:54,854 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2019-10-02 23:34:54,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:34:54,911 INFO L225 Difference]: With dead ends: 18314 [2019-10-02 23:34:54,912 INFO L226 Difference]: Without dead ends: 17964 [2019-10-02 23:34:54,912 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:34:54,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17964 states. [2019-10-02 23:34:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17964 to 13001. [2019-10-02 23:34:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13001 states. [2019-10-02 23:34:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13001 states to 13001 states and 17551 transitions. [2019-10-02 23:34:55,293 INFO L78 Accepts]: Start accepts. Automaton has 13001 states and 17551 transitions. Word has length 182 [2019-10-02 23:34:55,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:34:55,294 INFO L475 AbstractCegarLoop]: Abstraction has 13001 states and 17551 transitions. [2019-10-02 23:34:55,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 23:34:55,294 INFO L276 IsEmpty]: Start isEmpty. Operand 13001 states and 17551 transitions. [2019-10-02 23:34:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 23:34:55,307 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:34:55,307 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:34:55,308 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:34:55,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:34:55,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1651809766, now seen corresponding path program 1 times [2019-10-02 23:34:55,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:34:55,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:34:55,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:34:55,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:34:55,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:34:55,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:34:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 23:34:56,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 23:34:56,213 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 23:34:56,214 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 204 with the following transitions: [2019-10-02 23:34:56,217 INFO L207 CegarAbsIntRunner]: [25], [27], [28], [92], [93], [139], [141], [142], [143], [144], [145], [148], [152], [154], [158], [162], [164], [168], [172], [177], [183], [185], [187], [189], [194], [196], [199], [204], [207], [213], [216], [221], [222], [223], [224], [225], [348], [349], [362], [364], [365], [366], [367], [386], [532], [533], [538], [541], [546], [547], [548], [550], [552], [553], [595], [596], [604], [605], [630], [632], [634], [685], [688], [691], [694], [697], [699], [703], [706], [709], [711], [714], [722], [740], [743], [746], [765], [784], [803], [806], [809], [811], [814], [822], [841], [860], [879], [898], [917], [936], [955], [974], [977], [980], [982], [985], [1309], [1312], [1416], [1418], [1422], [1433], [1436], [1441], [1443], [1448], [1450], [1455], [1457], [1462], [1468], [1473], [1474], [1479], [1480], [1567], [1584], [1586], [1587], [1612], [1619], [1628], [1699], [1701], [1702], [1721], [1722], [1743], [1744], [1745], [1746], [1747], [1748], [1749], [1750], [1783], [1784], [1815], [1816], [1817], [1818], [1833], [1834], [1839], [1840], [1841], [1842], [1849], [1850], [1867], [1868], [1883], [1911], [1912], [1913], [1914], [1943], [1944], [1947], [1948], [1949], [1950], [1951], [1952], [1953], [1954], [1991], [1992], [1993], [1994], [1997], [1998], [2009], [2015], [2016], [2017], [2029], [2030] [2019-10-02 23:34:56,338 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 23:34:56,338 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 23:34:57,919 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 23:34:57,921 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 963 root evaluator evaluations with a maximum evaluation depth of 0. Performed 963 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 1930 variables. [2019-10-02 23:34:57,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:34:57,926 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 23:34:58,070 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-02 23:34:58,070 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 23:34:58,075 INFO L420 sIntCurrentIteration]: We unified 202 AI predicates to 202 [2019-10-02 23:34:58,076 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 23:34:58,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 23:34:58,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 23:34:58,077 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:34:58,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 23:34:58,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 23:34:58,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 23:34:58,079 INFO L87 Difference]: Start difference. First operand 13001 states and 17551 transitions. Second operand 2 states. [2019-10-02 23:34:58,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:34:58,080 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-02 23:34:58,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 23:34:58,080 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 203 [2019-10-02 23:34:58,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:34:58,081 INFO L225 Difference]: With dead ends: 2 [2019-10-02 23:34:58,081 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 23:34:58,083 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 23:34:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 23:34:58,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 23:34:58,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 23:34:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 23:34:58,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 203 [2019-10-02 23:34:58,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:34:58,084 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 23:34:58,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 23:34:58,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 23:34:58,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 23:34:58,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:34:58 BoogieIcfgContainer [2019-10-02 23:34:58,091 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 23:34:58,101 INFO L168 Benchmark]: Toolchain (without parser) took 434227.37 ms. Allocated memory was 135.3 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 82.5 MB in the beginning and 305.4 MB in the end (delta: -222.9 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-10-02 23:34:58,102 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 135.3 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-02 23:34:58,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2136.68 ms. Allocated memory was 135.3 MB in the beginning and 228.1 MB in the end (delta: 92.8 MB). Free memory was 82.3 MB in the beginning and 154.7 MB in the end (delta: -72.4 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. [2019-10-02 23:34:58,104 INFO L168 Benchmark]: Boogie Preprocessor took 532.00 ms. Allocated memory is still 228.1 MB. Free memory was 154.7 MB in the beginning and 111.1 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. [2019-10-02 23:34:58,105 INFO L168 Benchmark]: RCFGBuilder took 48134.91 ms. Allocated memory was 228.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 111.1 MB in the beginning and 869.8 MB in the end (delta: -758.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-02 23:34:58,109 INFO L168 Benchmark]: TraceAbstraction took 383417.29 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 505.4 MB). Free memory was 869.8 MB in the beginning and 305.4 MB in the end (delta: 564.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-02 23:34:58,121 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 135.3 MB. Free memory was 106.5 MB in the beginning and 106.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2136.68 ms. Allocated memory was 135.3 MB in the beginning and 228.1 MB in the end (delta: 92.8 MB). Free memory was 82.3 MB in the beginning and 154.7 MB in the end (delta: -72.4 MB). Peak memory consumption was 91.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 532.00 ms. Allocated memory is still 228.1 MB. Free memory was 154.7 MB in the beginning and 111.1 MB in the end (delta: 43.5 MB). Peak memory consumption was 43.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 48134.91 ms. Allocated memory was 228.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 111.1 MB in the beginning and 869.8 MB in the end (delta: -758.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * TraceAbstraction took 383417.29 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 505.4 MB). Free memory was 869.8 MB in the beginning and 305.4 MB in the end (delta: 564.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3247]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 108 procedures, 873 locations, 1 error locations. SAFE Result, 383.3s OverallTime, 22 OverallIterations, 4 TraceHistogramMax, 350.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23353 SDtfs, 13235 SDslu, 33896 SDs, 0 SdLazy, 1274 SolverSat, 174 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 332.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 302 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29537occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.7s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 1.7425742574257426 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 6135 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 2.3s SsaConstructionTime, 7.1s SatisfiabilityAnalysisTime, 14.3s InterpolantComputationTime, 2522 NumberOfCodeBlocks, 2522 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2500 ConstructedInterpolants, 0 QuantifiedInterpolants, 421409 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 21 PerfectInterpolantSequences, 589/609 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...