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-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 23:38:36,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 23:38:36,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 23:38:36,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 23:38:36,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 23:38:36,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 23:38:36,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 23:38:36,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 23:38:36,753 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 23:38:36,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 23:38:36,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 23:38:36,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 23:38:36,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 23:38:36,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 23:38:36,760 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 23:38:36,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 23:38:36,762 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 23:38:36,764 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 23:38:36,766 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 23:38:36,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 23:38:36,772 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 23:38:36,773 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 23:38:36,775 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 23:38:36,776 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 23:38:36,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 23:38:36,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 23:38:36,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 23:38:36,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 23:38:36,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 23:38:36,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 23:38:36,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 23:38:36,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 23:38:36,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 23:38:36,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 23:38:36,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 23:38:36,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 23:38:36,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 23:38:36,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 23:38:36,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 23:38:36,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 23:38:36,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 23:38:36,791 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:38:36,807 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 23:38:36,807 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 23:38:36,807 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 23:38:36,808 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 23:38:36,808 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 23:38:36,808 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 23:38:36,809 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 23:38:36,809 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 23:38:36,809 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 23:38:36,809 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 23:38:36,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 23:38:36,810 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 23:38:36,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 23:38:36,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 23:38:36,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 23:38:36,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 23:38:36,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 23:38:36,811 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 23:38:36,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 23:38:36,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 23:38:36,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 23:38:36,812 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 23:38:36,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 23:38:36,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 23:38:36,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 23:38:36,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 23:38:36,813 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 23:38:36,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 23:38:36,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 23:38:36,814 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 23:38:36,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 23:38:36,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 23:38:36,864 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 23:38:36,865 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 23:38:36,866 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 23:38:36,867 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2019-10-02 23:38:36,942 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e2b368e/1851b17cbc4b4819a6a1a1d4342336d8/FLAGf43a138d1 [2019-10-02 23:38:37,795 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 23:38:37,797 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.12-rc1/linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2019-10-02 23:38:37,843 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e2b368e/1851b17cbc4b4819a6a1a1d4342336d8/FLAGf43a138d1 [2019-10-02 23:38:38,260 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e2b368e/1851b17cbc4b4819a6a1a1d4342336d8 [2019-10-02 23:38:38,270 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 23:38:38,272 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 23:38:38,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 23:38:38,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 23:38:38,276 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 23:38:38,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:38:38" (1/1) ... [2019-10-02 23:38:38,280 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fb49e93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:38, skipping insertion in model container [2019-10-02 23:38:38,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:38:38" (1/1) ... [2019-10-02 23:38:38,288 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 23:38:38,440 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 23:38:40,757 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 23:38:40,801 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 23:38:41,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 23:38:41,521 INFO L192 MainTranslator]: Completed translation [2019-10-02 23:38:41,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:41 WrapperNode [2019-10-02 23:38:41,522 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 23:38:41,523 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 23:38:41,523 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 23:38:41,523 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 23:38:41,537 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:41" (1/1) ... [2019-10-02 23:38:41,538 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:41" (1/1) ... [2019-10-02 23:38:41,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:41" (1/1) ... [2019-10-02 23:38:41,621 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:41" (1/1) ... [2019-10-02 23:38:41,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:41" (1/1) ... [2019-10-02 23:38:41,812 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:41" (1/1) ... [2019-10-02 23:38:41,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:41" (1/1) ... [2019-10-02 23:38:41,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 23:38:41,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 23:38:41,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 23:38:41,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 23:38:41,885 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 23:38:41,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 23:38:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 23:38:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~gfp_t~0~X~$Pointer$~TO~$Pointer$ [2019-10-02 23:38:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~dma_addr_t~0~X~$Pointer$~TO~VOID [2019-10-02 23:38:41,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2019-10-02 23:38:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-02 23:38:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-10-02 23:38:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-10-02 23:38:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __arch_swab32 [2019-10-02 23:38:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2019-10-02 23:38:41,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2019-10-02 23:38:41,976 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-10-02 23:38:41,977 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-02 23:38:41,978 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_local_save_flags [2019-10-02 23:38:41,978 INFO L138 BoogieDeclarations]: Found implementation of procedure arch_irqs_disabled_flags [2019-10-02 23:38:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-10-02 23:38:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2019-10-02 23:38:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-10-02 23:38:41,979 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-10-02 23:38:41,980 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_schedule [2019-10-02 23:38:41,981 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-02 23:38:41,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-02 23:38:41,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-02 23:38:41,981 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-02 23:38:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-02 23:38:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 23:38:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-02 23:38:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-02 23:38:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-02 23:38:41,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-02 23:38:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 23:38:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-02 23:38:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 23:38:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-02 23:38:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure is_device_dma_capable [2019-10-02 23:38:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2019-10-02 23:38:41,983 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_coherent_mask [2019-10-02 23:38:41,984 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_coherent_gfp_flags [2019-10-02 23:38:41,984 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_attrs [2019-10-02 23:38:41,984 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2019-10-02 23:38:41,984 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2019-10-02 23:38:41,984 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2019-10-02 23:38:41,985 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-02 23:38:41,985 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-02 23:38:41,985 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-02 23:38:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_handle_irq [2019-10-02 23:38:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure crc16 [2019-10-02 23:38:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_send_command [2019-10-02 23:38:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_get_stb_state [2019-10-02 23:38:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_audio_pes2ts_cb [2019-10-02 23:38:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_video_pes2ts_cb [2019-10-02 23:38:41,986 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_pids [2019-10-02 23:38:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_pva [2019-10-02 23:38:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_filter [2019-10-02 23:38:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_packet [2019-10-02 23:38:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure swap_bytes [2019-10-02 23:38:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb_frame [2019-10-02 23:38:41,987 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb_frame_list [2019-10-02 23:38:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_process_urb [2019-10-02 23:38:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_setup_urbs [2019-10-02 23:38:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_iso_xfer [2019-10-02 23:38:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_interface [2019-10-02 23:38:41,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_iso_xfer [2019-10-02 23:38:41,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_ts_feed [2019-10-02 23:38:41,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_sec_feed [2019-10-02 23:38:41,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_start_feed [2019-10-02 23:38:41,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_ts_feed [2019-10-02 23:38:41,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_sec_feed [2019-10-02 23:38:41,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_stop_feed [2019-10-02 23:38:41,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_free_iso_urbs [2019-10-02 23:38:41,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_alloc_iso_urbs [2019-10-02 23:38:41,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_tasklet [2019-10-02 23:38:41,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_init_rc [2019-10-02 23:38:41,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_v_pes [2019-10-02 23:38:41,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_usb [2019-10-02 23:38:41,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_boot_dsp [2019-10-02 23:38:41,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_stb [2019-10-02 23:38:41,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_dvb [2019-10-02 23:38:41,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_dvb [2019-10-02 23:38:41,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_rc [2019-10-02 23:38:41,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_usb [2019-10-02 23:38:41,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_tasklet [2019-10-02 23:38:41,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_init_filters [2019-10-02 23:38:41,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_exit_filters [2019-10-02 23:38:41,994 INFO L138 BoogieDeclarations]: Found implementation of procedure fe_send_command [2019-10-02 23:38:41,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_probe [2019-10-02 23:38:41,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_disconnect [2019-10-02 23:38:41,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_set_model [2019-10-02 23:38:41,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_driver_init [2019-10-02 23:38:41,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusb_dec_driver_exit [2019-10-02 23:38:41,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_1 [2019-10-02 23:38:41,996 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 23:38:41,996 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-02 23:38:41,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_2 [2019-10-02 23:38:41,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_3 [2019-10-02 23:38:41,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_4 [2019-10-02 23:38:41,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_5 [2019-10-02 23:38:41,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_6 [2019-10-02 23:38:41,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_submit_urb_7 [2019-10-02 23:38:41,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_alloc_urb_8 [2019-10-02 23:38:41,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_9 [2019-10-02 23:38:41,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_fill_int_urb_10 [2019-10-02 23:38:41,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_free_urb_11 [2019-10-02 23:38:41,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata_12 [2019-10-02 23:38:41,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata_13 [2019-10-02 23:38:41,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_15 [2019-10-02 23:38:41,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_16 [2019-10-02 23:38:41,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop___0 [2019-10-02 23:38:41,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_get_intfdata [2019-10-02 23:38:41,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_set_intfdata [2019-10-02 23:38:41,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_put_intf [2019-10-02 23:38:41,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_alloc_urb [2019-10-02 23:38:41,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_urb [2019-10-02 23:38:41,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_int_urb [2019-10-02 23:38:41,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_fill_bulk_urb [2019-10-02 23:38:42,000 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_urb [2019-10-02 23:38:42,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interface_to_usbdev [2019-10-02 23:38:42,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_dev [2019-10-02 23:38:42,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_dev [2019-10-02 23:38:42,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_get_interface [2019-10-02 23:38:42,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_put_interface [2019-10-02 23:38:42,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_register [2019-10-02 23:38:42,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_serial_deregister [2019-10-02 23:38:42,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 23:38:42,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-10-02 23:38:42,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-10-02 23:38:42,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-10-02 23:38:42,004 INFO L138 BoogieDeclarations]: Found implementation of procedure __tasklet_schedule [2019-10-02 23:38:42,004 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-10-02 23:38:42,004 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-10-02 23:38:42,004 INFO L138 BoogieDeclarations]: Found implementation of procedure crc32_le [2019-10-02 23:38:42,005 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_alloc_coherent [2019-10-02 23:38:42,005 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_free_coherent [2019-10-02 23:38:42,005 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_init [2019-10-02 23:38:42,005 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmx_release [2019-10-02 23:38:42,005 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_init [2019-10-02 23:38:42,005 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_dmxdev_release [2019-10-02 23:38:42,006 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts [2019-10-02 23:38:42,006 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_filter_pes2ts_init [2019-10-02 23:38:42,010 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_net_init [2019-10-02 23:38:42,010 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_net_release [2019-10-02 23:38:42,011 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_register_adapter [2019-10-02 23:38:42,011 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_register_frontend [2019-10-02 23:38:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_adapter [2019-10-02 23:38:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure dvb_unregister_frontend [2019-10-02 23:38:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-02 23:38:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-02 23:38:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-02 23:38:42,018 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-02 23:38:42,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 23:38:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2019-10-02 23:38:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible_nested [2019-10-02 23:38:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 23:38:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 23:38:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2019-10-02 23:38:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure request_firmware [2019-10-02 23:38:42,019 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-02 23:38:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_init [2019-10-02 23:38:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure tasklet_kill [2019-10-02 23:38:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusbdecfe_dvbs_attach [2019-10-02 23:38:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ttusbdecfe_dvbt_attach [2019-10-02 23:38:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-02 23:38:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2019-10-02 23:38:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-02 23:38:42,020 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-02 23:38:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-02 23:38:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-02 23:38:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2019-10-02 23:38:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-10-02 23:38:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 23:38:42,021 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 23:38:42,022 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 23:38:42,022 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-02 23:38:42,022 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-10-02 23:38:42,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 23:38:42,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 23:38:42,022 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-10-02 23:38:42,022 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 23:38:42,022 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-02 23:38:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure __arch_swab32 [2019-10-02 23:38:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2019-10-02 23:38:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2019-10-02 23:38:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-10-02 23:38:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-02 23:38:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 23:38:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-02 23:38:42,023 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-10-02 23:38:42,024 INFO L130 BoogieDeclarations]: Found specification of procedure arch_local_save_flags [2019-10-02 23:38:42,024 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 23:38:42,024 INFO L130 BoogieDeclarations]: Found specification of procedure arch_irqs_disabled_flags [2019-10-02 23:38:42,024 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-10-02 23:38:42,024 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 23:38:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-10-02 23:38:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2019-10-02 23:38:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2019-10-02 23:38:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-10-02 23:38:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-10-02 23:38:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-10-02 23:38:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-10-02 23:38:42,025 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-10-02 23:38:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-10-02 23:38:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible_nested [2019-10-02 23:38:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 23:38:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure __tasklet_schedule [2019-10-02 23:38:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_schedule [2019-10-02 23:38:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_kill [2019-10-02 23:38:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure tasklet_init [2019-10-02 23:38:42,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata_13 [2019-10-02 23:38:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata_12 [2019-10-02 23:38:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-02 23:38:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-02 23:38:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 23:38:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-02 23:38:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_15 [2019-10-02 23:38:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-02 23:38:42,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_16 [2019-10-02 23:38:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_fill_int_urb_10 [2019-10-02 23:38:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_6 [2019-10-02 23:38:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_alloc_urb_8 [2019-10-02 23:38:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_5 [2019-10-02 23:38:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_9 [2019-10-02 23:38:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_free_urb_11 [2019-10-02 23:38:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_2 [2019-10-02 23:38:42,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_3 [2019-10-02 23:38:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_4 [2019-10-02 23:38:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_submit_urb_7 [2019-10-02 23:38:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-02 23:38:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-02 23:38:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-02 23:38:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2019-10-02 23:38:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2019-10-02 23:38:42,029 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-02 23:38:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 23:38:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_alloc_urb [2019-10-02 23:38:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_urb [2019-10-02 23:38:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_int_urb [2019-10-02 23:38:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_urb [2019-10-02 23:38:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interface_to_usbdev [2019-10-02 23:38:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_get_intfdata [2019-10-02 23:38:42,030 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_set_intfdata [2019-10-02 23:38:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 23:38:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 23:38:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-02 23:38:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-02 23:38:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-02 23:38:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 23:38:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 23:38:42,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 23:38:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 23:38:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 23:38:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 23:38:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 23:38:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-02 23:38:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-02 23:38:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-02 23:38:42,032 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-02 23:38:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-02 23:38:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 23:38:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-02 23:38:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-02 23:38:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_1 [2019-10-02 23:38:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure is_device_dma_capable [2019-10-02 23:38:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_alloc_coherent [2019-10-02 23:38:42,033 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_free_coherent [2019-10-02 23:38:42,034 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2019-10-02 23:38:42,035 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_coherent_mask [2019-10-02 23:38:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_coherent_gfp_flags [2019-10-02 23:38:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_attrs [2019-10-02 23:38:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~gfp_t~0~X~$Pointer$~TO~$Pointer$ [2019-10-02 23:38:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2019-10-02 23:38:42,039 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~~dma_addr_t~0~X~$Pointer$~TO~VOID [2019-10-02 23:38:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2019-10-02 23:38:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2019-10-02 23:38:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure request_firmware [2019-10-02 23:38:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2019-10-02 23:38:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure crc32_le [2019-10-02 23:38:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-02 23:38:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-02 23:38:42,042 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-02 23:38:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-02 23:38:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-02 23:38:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-02 23:38:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-02 23:38:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_register_adapter [2019-10-02 23:38:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_adapter [2019-10-02 23:38:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_init [2019-10-02 23:38:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmxdev_release [2019-10-02 23:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_init [2019-10-02 23:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_dmx_release [2019-10-02 23:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts_init [2019-10-02 23:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_filter_pes2ts [2019-10-02 23:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_register_frontend [2019-10-02 23:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_unregister_frontend [2019-10-02 23:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_net_release [2019-10-02 23:38:42,044 INFO L130 BoogieDeclarations]: Found specification of procedure dvb_net_init [2019-10-02 23:38:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure ttusbdecfe_dvbs_attach [2019-10-02 23:38:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure ttusbdecfe_dvbt_attach [2019-10-02 23:38:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_model [2019-10-02 23:38:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_handle_irq [2019-10-02 23:38:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure crc16 [2019-10-02 23:38:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_send_command [2019-10-02 23:38:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-10-02 23:38:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 23:38:42,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 23:38:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_get_stb_state [2019-10-02 23:38:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_audio_pes2ts_cb [2019-10-02 23:38:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~X~$Pointer$~X~int~X~$Pointer$~X~int~TO~int [2019-10-02 23:38:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_video_pes2ts_cb [2019-10-02 23:38:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_pids [2019-10-02 23:38:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_pva [2019-10-02 23:38:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_filter [2019-10-02 23:38:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_packet [2019-10-02 23:38:42,046 INFO L130 BoogieDeclarations]: Found specification of procedure swap_bytes [2019-10-02 23:38:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb_frame [2019-10-02 23:38:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb_frame_list [2019-10-02 23:38:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_process_urb [2019-10-02 23:38:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_setup_urbs [2019-10-02 23:38:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_iso_xfer [2019-10-02 23:38:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_set_interface [2019-10-02 23:38:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_iso_xfer [2019-10-02 23:38:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_ts_feed [2019-10-02 23:38:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_sec_feed [2019-10-02 23:38:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_start_feed [2019-10-02 23:38:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_ts_feed [2019-10-02 23:38:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_sec_feed [2019-10-02 23:38:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_stop_feed [2019-10-02 23:38:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_free_iso_urbs [2019-10-02 23:38:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_alloc_iso_urbs [2019-10-02 23:38:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 23:38:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_tasklet [2019-10-02 23:38:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_init_rc [2019-10-02 23:38:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_v_pes [2019-10-02 23:38:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_usb [2019-10-02 23:38:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_boot_dsp [2019-10-02 23:38:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_stb [2019-10-02 23:38:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_dvb [2019-10-02 23:38:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2019-10-02 23:38:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_dvb [2019-10-02 23:38:42,049 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-10-02 23:38:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-10-02 23:38:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_rc [2019-10-02 23:38:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_usb [2019-10-02 23:38:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_tasklet [2019-10-02 23:38:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_init_filters [2019-10-02 23:38:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_exit_filters [2019-10-02 23:38:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure fe_send_command [2019-10-02 23:38:42,050 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_probe [2019-10-02 23:38:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_disconnect [2019-10-02 23:38:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_driver_init [2019-10-02 23:38:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure ttusb_dec_driver_exit [2019-10-02 23:38:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 23:38:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 23:38:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 23:38:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop___0 [2019-10-02 23:38:42,051 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_put_intf [2019-10-02 23:38:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_fill_bulk_urb [2019-10-02 23:38:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_dev [2019-10-02 23:38:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_dev [2019-10-02 23:38:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_get_interface [2019-10-02 23:38:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_put_interface [2019-10-02 23:38:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_register [2019-10-02 23:38:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_serial_deregister [2019-10-02 23:38:42,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-02 23:38:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 23:38:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 23:38:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 23:38:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 23:38:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 23:38:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 23:38:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-10-02 23:38:42,053 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-10-02 23:38:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-10-02 23:38:42,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-10-02 23:38:43,315 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-02 23:38:51,481 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stop___0FINAL: assume true; [2019-10-02 23:38:54,474 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 23:38:54,474 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 23:38:54,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:38:54 BoogieIcfgContainer [2019-10-02 23:38:54,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 23:38:54,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 23:38:54,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 23:38:54,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 23:38:54,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:38:38" (1/3) ... [2019-10-02 23:38:54,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4611c139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:38:54, skipping insertion in model container [2019-10-02 23:38:54,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:38:41" (2/3) ... [2019-10-02 23:38:54,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4611c139 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:38:54, skipping insertion in model container [2019-10-02 23:38:54,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:38:54" (3/3) ... [2019-10-02 23:38:54,487 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-3.12-rc1.tar.xz-144_2a-drivers--media--usb--ttusb-dec--ttusb_dec.ko-entry_point.cil.out.i [2019-10-02 23:38:54,497 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 23:38:54,508 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 23:38:54,522 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 23:38:54,542 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 23:38:54,542 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 23:38:54,543 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 23:38:54,543 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 23:38:54,543 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 23:38:54,545 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 23:38:54,545 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 23:38:54,546 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 23:38:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states. [2019-10-02 23:38:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-10-02 23:38:54,618 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:38:54,619 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:54,622 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:38:54,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:38:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash 268978720, now seen corresponding path program 1 times [2019-10-02 23:38:54,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:38:54,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:38:54,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:38:54,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:38:54,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:38:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:38:55,478 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 23:38:55,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:38:55,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:38:55,480 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:38:55,485 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:38:55,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:38:55,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:38:55,503 INFO L87 Difference]: Start difference. First operand 1545 states. Second operand 3 states. [2019-10-02 23:38:58,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:38:58,404 INFO L93 Difference]: Finished difference Result 2655 states and 3437 transitions. [2019-10-02 23:38:58,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:38:58,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-10-02 23:38:58,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:38:58,448 INFO L225 Difference]: With dead ends: 2655 [2019-10-02 23:38:58,448 INFO L226 Difference]: Without dead ends: 2630 [2019-10-02 23:38:58,452 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:38:58,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2019-10-02 23:38:58,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 2630. [2019-10-02 23:38:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-10-02 23:38:58,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3398 transitions. [2019-10-02 23:38:58,683 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3398 transitions. Word has length 68 [2019-10-02 23:38:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:38:58,684 INFO L475 AbstractCegarLoop]: Abstraction has 2630 states and 3398 transitions. [2019-10-02 23:38:58,684 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:38:58,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3398 transitions. [2019-10-02 23:38:58,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 23:38:58,700 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:38:58,701 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:58,701 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:38:58,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:38:58,702 INFO L82 PathProgramCache]: Analyzing trace with hash 281279441, now seen corresponding path program 1 times [2019-10-02 23:38:58,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:38:58,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:38:58,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:38:58,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:38:58,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:38:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:38:59,033 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 23:38:59,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:38:59,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:38:59,034 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:38:59,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:38:59,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:38:59,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:38:59,037 INFO L87 Difference]: Start difference. First operand 2630 states and 3398 transitions. Second operand 3 states. [2019-10-02 23:38:59,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:38:59,424 INFO L93 Difference]: Finished difference Result 2643 states and 3413 transitions. [2019-10-02 23:38:59,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:38:59,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-02 23:38:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:38:59,439 INFO L225 Difference]: With dead ends: 2643 [2019-10-02 23:38:59,440 INFO L226 Difference]: Without dead ends: 2643 [2019-10-02 23:38:59,441 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:38:59,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-10-02 23:38:59,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2630. [2019-10-02 23:38:59,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-10-02 23:38:59,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3397 transitions. [2019-10-02 23:38:59,524 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3397 transitions. Word has length 84 [2019-10-02 23:38:59,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:38:59,525 INFO L475 AbstractCegarLoop]: Abstraction has 2630 states and 3397 transitions. [2019-10-02 23:38:59,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:38:59,525 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3397 transitions. [2019-10-02 23:38:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-02 23:38:59,527 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:38:59,527 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:59,528 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:38:59,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:38:59,528 INFO L82 PathProgramCache]: Analyzing trace with hash 338537743, now seen corresponding path program 1 times [2019-10-02 23:38:59,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:38:59,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:38:59,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:38:59,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:38:59,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:38:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:38:59,872 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 23:38:59,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:38:59,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:38:59,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:38:59,873 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:38:59,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:38:59,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:38:59,874 INFO L87 Difference]: Start difference. First operand 2630 states and 3397 transitions. Second operand 3 states. [2019-10-02 23:39:00,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:00,101 INFO L93 Difference]: Finished difference Result 5228 states and 6914 transitions. [2019-10-02 23:39:00,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:00,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-02 23:39:00,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:00,149 INFO L225 Difference]: With dead ends: 5228 [2019-10-02 23:39:00,150 INFO L226 Difference]: Without dead ends: 5228 [2019-10-02 23:39:00,155 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:00,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2019-10-02 23:39:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5218. [2019-10-02 23:39:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-10-02 23:39:00,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 6902 transitions. [2019-10-02 23:39:00,350 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 6902 transitions. Word has length 84 [2019-10-02 23:39:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:00,351 INFO L475 AbstractCegarLoop]: Abstraction has 5218 states and 6902 transitions. [2019-10-02 23:39:00,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:00,351 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 6902 transitions. [2019-10-02 23:39:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 23:39:00,352 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:00,353 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:00,353 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:00,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:00,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1904077563, now seen corresponding path program 1 times [2019-10-02 23:39:00,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:00,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:00,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:00,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:00,370 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:00,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:00,658 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-02 23:39:00,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:00,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:39:00,659 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:00,659 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:39:00,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:39:00,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:39:00,660 INFO L87 Difference]: Start difference. First operand 5218 states and 6902 transitions. Second operand 4 states. [2019-10-02 23:39:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:00,772 INFO L93 Difference]: Finished difference Result 5235 states and 6924 transitions. [2019-10-02 23:39:00,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:39:00,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-02 23:39:00,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:00,807 INFO L225 Difference]: With dead ends: 5235 [2019-10-02 23:39:00,807 INFO L226 Difference]: Without dead ends: 5235 [2019-10-02 23:39:00,807 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:39:00,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5235 states. [2019-10-02 23:39:00,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5235 to 5223. [2019-10-02 23:39:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5223 states. [2019-10-02 23:39:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5223 states to 5223 states and 6908 transitions. [2019-10-02 23:39:01,010 INFO L78 Accepts]: Start accepts. Automaton has 5223 states and 6908 transitions. Word has length 85 [2019-10-02 23:39:01,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:01,011 INFO L475 AbstractCegarLoop]: Abstraction has 5223 states and 6908 transitions. [2019-10-02 23:39:01,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:39:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 5223 states and 6908 transitions. [2019-10-02 23:39:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-02 23:39:01,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:01,014 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:01,014 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:01,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1636869164, now seen corresponding path program 1 times [2019-10-02 23:39:01,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:01,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:01,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:01,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:01,038 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:01,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 23:39:01,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:01,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:01,454 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:01,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:01,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:01,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:01,455 INFO L87 Difference]: Start difference. First operand 5223 states and 6908 transitions. Second operand 3 states. [2019-10-02 23:39:01,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:01,512 INFO L93 Difference]: Finished difference Result 5222 states and 6906 transitions. [2019-10-02 23:39:01,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:01,513 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-02 23:39:01,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:01,542 INFO L225 Difference]: With dead ends: 5222 [2019-10-02 23:39:01,543 INFO L226 Difference]: Without dead ends: 5222 [2019-10-02 23:39:01,543 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:39:01,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5222 states. [2019-10-02 23:39:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5222 to 5222. [2019-10-02 23:39:01,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-10-02 23:39:01,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 6906 transitions. [2019-10-02 23:39:01,719 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 6906 transitions. Word has length 86 [2019-10-02 23:39:01,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:01,719 INFO L475 AbstractCegarLoop]: Abstraction has 5222 states and 6906 transitions. [2019-10-02 23:39:01,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 6906 transitions. [2019-10-02 23:39:01,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 23:39:01,721 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:01,721 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:01,722 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:01,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:01,722 INFO L82 PathProgramCache]: Analyzing trace with hash 796010457, now seen corresponding path program 1 times [2019-10-02 23:39:01,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:01,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:01,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:01,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:01,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:01,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 23:39:02,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:02,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:02,908 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:02,908 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:02,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:02,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:02,909 INFO L87 Difference]: Start difference. First operand 5222 states and 6906 transitions. Second operand 3 states. [2019-10-02 23:39:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:02,985 INFO L93 Difference]: Finished difference Result 5221 states and 6904 transitions. [2019-10-02 23:39:02,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:02,985 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-10-02 23:39:02,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:03,025 INFO L225 Difference]: With dead ends: 5221 [2019-10-02 23:39:03,026 INFO L226 Difference]: Without dead ends: 5221 [2019-10-02 23:39:03,026 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:39:03,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5221 states. [2019-10-02 23:39:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5221 to 5221. [2019-10-02 23:39:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5221 states. [2019-10-02 23:39:03,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5221 states to 5221 states and 6904 transitions. [2019-10-02 23:39:03,205 INFO L78 Accepts]: Start accepts. Automaton has 5221 states and 6904 transitions. Word has length 87 [2019-10-02 23:39:03,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:03,206 INFO L475 AbstractCegarLoop]: Abstraction has 5221 states and 6904 transitions. [2019-10-02 23:39:03,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:03,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5221 states and 6904 transitions. [2019-10-02 23:39:03,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 23:39:03,208 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:03,208 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:03,208 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:03,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:03,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1094127753, now seen corresponding path program 1 times [2019-10-02 23:39:03,209 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:03,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:03,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:03,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:03,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:03,501 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 23:39:03,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:03,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:03,502 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:03,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:03,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:03,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:03,503 INFO L87 Difference]: Start difference. First operand 5221 states and 6904 transitions. Second operand 3 states. [2019-10-02 23:39:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:03,573 INFO L93 Difference]: Finished difference Result 5220 states and 6902 transitions. [2019-10-02 23:39:03,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:03,574 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-10-02 23:39:03,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:03,609 INFO L225 Difference]: With dead ends: 5220 [2019-10-02 23:39:03,609 INFO L226 Difference]: Without dead ends: 5220 [2019-10-02 23:39:03,609 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:39:03,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5220 states. [2019-10-02 23:39:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5220 to 5220. [2019-10-02 23:39:03,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5220 states. [2019-10-02 23:39:03,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5220 states to 5220 states and 6902 transitions. [2019-10-02 23:39:03,809 INFO L78 Accepts]: Start accepts. Automaton has 5220 states and 6902 transitions. Word has length 88 [2019-10-02 23:39:03,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:03,810 INFO L475 AbstractCegarLoop]: Abstraction has 5220 states and 6902 transitions. [2019-10-02 23:39:03,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5220 states and 6902 transitions. [2019-10-02 23:39:03,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 23:39:03,812 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:03,812 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:03,813 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:03,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:03,813 INFO L82 PathProgramCache]: Analyzing trace with hash 441134748, now seen corresponding path program 1 times [2019-10-02 23:39:03,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:03,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:03,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:03,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:03,838 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 23:39:04,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:04,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:04,125 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:04,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:04,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:04,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:04,126 INFO L87 Difference]: Start difference. First operand 5220 states and 6902 transitions. Second operand 3 states. [2019-10-02 23:39:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:04,180 INFO L93 Difference]: Finished difference Result 5219 states and 6900 transitions. [2019-10-02 23:39:04,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:04,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-10-02 23:39:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:04,206 INFO L225 Difference]: With dead ends: 5219 [2019-10-02 23:39:04,206 INFO L226 Difference]: Without dead ends: 5200 [2019-10-02 23:39:04,207 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:39:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5200 states. [2019-10-02 23:39:04,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5200 to 5200. [2019-10-02 23:39:04,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5200 states. [2019-10-02 23:39:04,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5200 states to 5200 states and 6879 transitions. [2019-10-02 23:39:04,358 INFO L78 Accepts]: Start accepts. Automaton has 5200 states and 6879 transitions. Word has length 89 [2019-10-02 23:39:04,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:04,358 INFO L475 AbstractCegarLoop]: Abstraction has 5200 states and 6879 transitions. [2019-10-02 23:39:04,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5200 states and 6879 transitions. [2019-10-02 23:39:04,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 23:39:04,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:04,368 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:39:04,368 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:04,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:04,368 INFO L82 PathProgramCache]: Analyzing trace with hash -224732367, now seen corresponding path program 1 times [2019-10-02 23:39:04,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:04,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:04,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:04,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:04,387 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:04,939 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 23:39:04,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:04,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:04,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:04,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:04,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:04,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:04,941 INFO L87 Difference]: Start difference. First operand 5200 states and 6879 transitions. Second operand 3 states. [2019-10-02 23:39:05,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:05,383 INFO L93 Difference]: Finished difference Result 5637 states and 7449 transitions. [2019-10-02 23:39:05,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:05,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-10-02 23:39:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:05,414 INFO L225 Difference]: With dead ends: 5637 [2019-10-02 23:39:05,414 INFO L226 Difference]: Without dead ends: 5635 [2019-10-02 23:39:05,415 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:39:05,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5635 states. [2019-10-02 23:39:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5635 to 5602. [2019-10-02 23:39:05,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5602 states. [2019-10-02 23:39:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5602 states to 5602 states and 7409 transitions. [2019-10-02 23:39:05,643 INFO L78 Accepts]: Start accepts. Automaton has 5602 states and 7409 transitions. Word has length 216 [2019-10-02 23:39:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:05,644 INFO L475 AbstractCegarLoop]: Abstraction has 5602 states and 7409 transitions. [2019-10-02 23:39:05,644 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:05,644 INFO L276 IsEmpty]: Start isEmpty. Operand 5602 states and 7409 transitions. [2019-10-02 23:39:05,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 23:39:05,652 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:05,653 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:05,653 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:05,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:05,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1636148992, now seen corresponding path program 1 times [2019-10-02 23:39:05,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:05,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:05,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:05,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:05,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:06,048 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-02 23:39:06,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:06,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:39:06,049 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:06,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:39:06,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:39:06,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:39:06,051 INFO L87 Difference]: Start difference. First operand 5602 states and 7409 transitions. Second operand 4 states. [2019-10-02 23:39:10,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:10,376 INFO L93 Difference]: Finished difference Result 5562 states and 7173 transitions. [2019-10-02 23:39:10,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:10,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-10-02 23:39:10,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:10,404 INFO L225 Difference]: With dead ends: 5562 [2019-10-02 23:39:10,405 INFO L226 Difference]: Without dead ends: 5562 [2019-10-02 23:39:10,405 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:39:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2019-10-02 23:39:10,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 5562. [2019-10-02 23:39:10,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5562 states. [2019-10-02 23:39:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 7173 transitions. [2019-10-02 23:39:10,631 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 7173 transitions. Word has length 235 [2019-10-02 23:39:10,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:10,631 INFO L475 AbstractCegarLoop]: Abstraction has 5562 states and 7173 transitions. [2019-10-02 23:39:10,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:39:10,631 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 7173 transitions. [2019-10-02 23:39:10,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 23:39:10,641 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:10,641 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:10,642 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:10,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:10,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1645605372, now seen corresponding path program 1 times [2019-10-02 23:39:10,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:10,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:10,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:10,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:10,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-10-02 23:39:11,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:11,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:39:11,018 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:11,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:39:11,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:39:11,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:39:11,019 INFO L87 Difference]: Start difference. First operand 5562 states and 7173 transitions. Second operand 4 states. [2019-10-02 23:39:15,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:15,394 INFO L93 Difference]: Finished difference Result 5118 states and 6619 transitions. [2019-10-02 23:39:15,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:15,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-10-02 23:39:15,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:15,414 INFO L225 Difference]: With dead ends: 5118 [2019-10-02 23:39:15,414 INFO L226 Difference]: Without dead ends: 5118 [2019-10-02 23:39:15,415 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:39:15,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5118 states. [2019-10-02 23:39:15,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5118 to 5118. [2019-10-02 23:39:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5118 states. [2019-10-02 23:39:15,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5118 states to 5118 states and 6619 transitions. [2019-10-02 23:39:15,535 INFO L78 Accepts]: Start accepts. Automaton has 5118 states and 6619 transitions. Word has length 235 [2019-10-02 23:39:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:15,537 INFO L475 AbstractCegarLoop]: Abstraction has 5118 states and 6619 transitions. [2019-10-02 23:39:15,537 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:39:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 5118 states and 6619 transitions. [2019-10-02 23:39:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2019-10-02 23:39:15,553 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:15,554 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:39:15,554 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:15,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:15,555 INFO L82 PathProgramCache]: Analyzing trace with hash -729876147, now seen corresponding path program 1 times [2019-10-02 23:39:15,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:15,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:15,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:15,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:15,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:16,019 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 23:39:16,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:16,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:16,020 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:16,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:16,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:16,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:16,022 INFO L87 Difference]: Start difference. First operand 5118 states and 6619 transitions. Second operand 3 states. [2019-10-02 23:39:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:16,756 INFO L93 Difference]: Finished difference Result 5134 states and 6639 transitions. [2019-10-02 23:39:16,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:16,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 290 [2019-10-02 23:39:16,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:16,788 INFO L225 Difference]: With dead ends: 5134 [2019-10-02 23:39:16,789 INFO L226 Difference]: Without dead ends: 5134 [2019-10-02 23:39:16,789 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:39:16,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2019-10-02 23:39:16,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 5122. [2019-10-02 23:39:16,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5122 states. [2019-10-02 23:39:16,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5122 states to 5122 states and 6623 transitions. [2019-10-02 23:39:16,924 INFO L78 Accepts]: Start accepts. Automaton has 5122 states and 6623 transitions. Word has length 290 [2019-10-02 23:39:16,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:16,925 INFO L475 AbstractCegarLoop]: Abstraction has 5122 states and 6623 transitions. [2019-10-02 23:39:16,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:16,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5122 states and 6623 transitions. [2019-10-02 23:39:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 23:39:16,941 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:16,941 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:39:16,943 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:16,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:16,943 INFO L82 PathProgramCache]: Analyzing trace with hash 695053850, now seen corresponding path program 1 times [2019-10-02 23:39:16,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:16,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:16,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:16,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:16,959 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:17,314 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 23:39:17,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:17,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:17,315 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:17,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:17,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:17,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:17,317 INFO L87 Difference]: Start difference. First operand 5122 states and 6623 transitions. Second operand 3 states. [2019-10-02 23:39:17,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:17,358 INFO L93 Difference]: Finished difference Result 5130 states and 6631 transitions. [2019-10-02 23:39:17,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:17,359 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 293 [2019-10-02 23:39:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:17,377 INFO L225 Difference]: With dead ends: 5130 [2019-10-02 23:39:17,377 INFO L226 Difference]: Without dead ends: 5130 [2019-10-02 23:39:17,378 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:17,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5130 states. [2019-10-02 23:39:17,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5130 to 5126. [2019-10-02 23:39:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5126 states. [2019-10-02 23:39:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 5126 states and 6627 transitions. [2019-10-02 23:39:17,489 INFO L78 Accepts]: Start accepts. Automaton has 5126 states and 6627 transitions. Word has length 293 [2019-10-02 23:39:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:17,489 INFO L475 AbstractCegarLoop]: Abstraction has 5126 states and 6627 transitions. [2019-10-02 23:39:17,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 5126 states and 6627 transitions. [2019-10-02 23:39:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 23:39:17,504 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:17,505 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:39:17,505 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:17,506 INFO L82 PathProgramCache]: Analyzing trace with hash -394219586, now seen corresponding path program 1 times [2019-10-02 23:39:17,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:17,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:17,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:17,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:17,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:17,885 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 23:39:17,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:17,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 23:39:17,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:17,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 23:39:17,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 23:39:17,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:39:17,888 INFO L87 Difference]: Start difference. First operand 5126 states and 6627 transitions. Second operand 7 states. [2019-10-02 23:39:17,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:17,961 INFO L93 Difference]: Finished difference Result 5162 states and 6679 transitions. [2019-10-02 23:39:17,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 23:39:17,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 295 [2019-10-02 23:39:17,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:17,980 INFO L225 Difference]: With dead ends: 5162 [2019-10-02 23:39:17,981 INFO L226 Difference]: Without dead ends: 5162 [2019-10-02 23:39:17,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:39:17,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5162 states. [2019-10-02 23:39:18,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5162 to 5154. [2019-10-02 23:39:18,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5154 states. [2019-10-02 23:39:18,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5154 states to 5154 states and 6659 transitions. [2019-10-02 23:39:18,090 INFO L78 Accepts]: Start accepts. Automaton has 5154 states and 6659 transitions. Word has length 295 [2019-10-02 23:39:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:18,093 INFO L475 AbstractCegarLoop]: Abstraction has 5154 states and 6659 transitions. [2019-10-02 23:39:18,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 23:39:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 5154 states and 6659 transitions. [2019-10-02 23:39:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2019-10-02 23:39:18,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:18,116 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:18,116 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:18,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:18,117 INFO L82 PathProgramCache]: Analyzing trace with hash -926203862, now seen corresponding path program 1 times [2019-10-02 23:39:18,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:18,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:18,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:18,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:18,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-10-02 23:39:18,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:18,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:18,578 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:18,579 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:18,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:18,579 INFO L87 Difference]: Start difference. First operand 5154 states and 6659 transitions. Second operand 3 states. [2019-10-02 23:39:18,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:18,622 INFO L93 Difference]: Finished difference Result 5170 states and 6681 transitions. [2019-10-02 23:39:18,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:18,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 345 [2019-10-02 23:39:18,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:18,643 INFO L225 Difference]: With dead ends: 5170 [2019-10-02 23:39:18,643 INFO L226 Difference]: Without dead ends: 5170 [2019-10-02 23:39:18,646 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:39:18,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5170 states. [2019-10-02 23:39:18,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5170 to 5158. [2019-10-02 23:39:18,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5158 states. [2019-10-02 23:39:18,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5158 states to 5158 states and 6663 transitions. [2019-10-02 23:39:18,761 INFO L78 Accepts]: Start accepts. Automaton has 5158 states and 6663 transitions. Word has length 345 [2019-10-02 23:39:18,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:18,761 INFO L475 AbstractCegarLoop]: Abstraction has 5158 states and 6663 transitions. [2019-10-02 23:39:18,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:18,762 INFO L276 IsEmpty]: Start isEmpty. Operand 5158 states and 6663 transitions. [2019-10-02 23:39:18,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 23:39:18,789 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:18,790 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:18,790 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:18,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:18,790 INFO L82 PathProgramCache]: Analyzing trace with hash -453460847, now seen corresponding path program 1 times [2019-10-02 23:39:18,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:18,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:18,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:18,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:18,803 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-02 23:39:19,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:19,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 23:39:19,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:19,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 23:39:19,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 23:39:19,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 23:39:19,373 INFO L87 Difference]: Start difference. First operand 5158 states and 6663 transitions. Second operand 11 states. [2019-10-02 23:39:19,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:19,537 INFO L93 Difference]: Finished difference Result 5250 states and 6775 transitions. [2019-10-02 23:39:19,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 23:39:19,538 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 357 [2019-10-02 23:39:19,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:19,557 INFO L225 Difference]: With dead ends: 5250 [2019-10-02 23:39:19,558 INFO L226 Difference]: Without dead ends: 5250 [2019-10-02 23:39:19,558 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 23:39:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2019-10-02 23:39:19,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 5218. [2019-10-02 23:39:19,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-10-02 23:39:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 6743 transitions. [2019-10-02 23:39:19,678 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 6743 transitions. Word has length 357 [2019-10-02 23:39:19,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:19,679 INFO L475 AbstractCegarLoop]: Abstraction has 5218 states and 6743 transitions. [2019-10-02 23:39:19,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 23:39:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 6743 transitions. [2019-10-02 23:39:19,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 23:39:19,706 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:19,706 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:19,706 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:19,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:19,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1290255790, now seen corresponding path program 1 times [2019-10-02 23:39:19,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:19,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:19,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:19,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:19,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-02 23:39:20,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:20,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:39:20,318 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:20,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:39:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:39:20,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:39:20,320 INFO L87 Difference]: Start difference. First operand 5218 states and 6743 transitions. Second operand 4 states. [2019-10-02 23:39:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:20,409 INFO L93 Difference]: Finished difference Result 5234 states and 6759 transitions. [2019-10-02 23:39:20,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 23:39:20,410 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-10-02 23:39:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:20,428 INFO L225 Difference]: With dead ends: 5234 [2019-10-02 23:39:20,428 INFO L226 Difference]: Without dead ends: 5218 [2019-10-02 23:39:20,429 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:39:20,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2019-10-02 23:39:20,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 5218. [2019-10-02 23:39:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-10-02 23:39:20,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 6739 transitions. [2019-10-02 23:39:20,566 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 6739 transitions. Word has length 357 [2019-10-02 23:39:20,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:20,567 INFO L475 AbstractCegarLoop]: Abstraction has 5218 states and 6739 transitions. [2019-10-02 23:39:20,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:39:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 6739 transitions. [2019-10-02 23:39:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 23:39:20,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:20,592 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:20,592 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:20,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:20,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1636250896, now seen corresponding path program 1 times [2019-10-02 23:39:20,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:20,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:20,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:20,605 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:21,245 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2019-10-02 23:39:21,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:21,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:39:21,246 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:21,247 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:39:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:39:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:39:21,248 INFO L87 Difference]: Start difference. First operand 5218 states and 6739 transitions. Second operand 4 states. [2019-10-02 23:39:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:21,348 INFO L93 Difference]: Finished difference Result 5234 states and 6755 transitions. [2019-10-02 23:39:21,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 23:39:21,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-10-02 23:39:21,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:21,368 INFO L225 Difference]: With dead ends: 5234 [2019-10-02 23:39:21,368 INFO L226 Difference]: Without dead ends: 5218 [2019-10-02 23:39:21,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:39:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5218 states. [2019-10-02 23:39:21,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5218 to 5218. [2019-10-02 23:39:21,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5218 states. [2019-10-02 23:39:21,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5218 states to 5218 states and 6735 transitions. [2019-10-02 23:39:21,485 INFO L78 Accepts]: Start accepts. Automaton has 5218 states and 6735 transitions. Word has length 357 [2019-10-02 23:39:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:21,485 INFO L475 AbstractCegarLoop]: Abstraction has 5218 states and 6735 transitions. [2019-10-02 23:39:21,485 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:39:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 5218 states and 6735 transitions. [2019-10-02 23:39:21,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-10-02 23:39:21,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:21,510 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:21,510 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:21,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:21,512 INFO L82 PathProgramCache]: Analyzing trace with hash -304331118, now seen corresponding path program 1 times [2019-10-02 23:39:21,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:21,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:21,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:21,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:21,524 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:21,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:22,031 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-10-02 23:39:22,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:22,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:39:22,032 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:22,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:39:22,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:39:22,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:39:22,034 INFO L87 Difference]: Start difference. First operand 5218 states and 6735 transitions. Second operand 4 states. [2019-10-02 23:39:22,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:22,146 INFO L93 Difference]: Finished difference Result 5230 states and 6747 transitions. [2019-10-02 23:39:22,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 23:39:22,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 357 [2019-10-02 23:39:22,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:22,164 INFO L225 Difference]: With dead ends: 5230 [2019-10-02 23:39:22,165 INFO L226 Difference]: Without dead ends: 5222 [2019-10-02 23:39:22,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:39:22,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5222 states. [2019-10-02 23:39:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5222 to 5222. [2019-10-02 23:39:22,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-10-02 23:39:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 6739 transitions. [2019-10-02 23:39:22,276 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 6739 transitions. Word has length 357 [2019-10-02 23:39:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:22,277 INFO L475 AbstractCegarLoop]: Abstraction has 5222 states and 6739 transitions. [2019-10-02 23:39:22,277 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:39:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 6739 transitions. [2019-10-02 23:39:22,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-02 23:39:22,296 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:22,296 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:22,297 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:22,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:22,297 INFO L82 PathProgramCache]: Analyzing trace with hash 93071593, now seen corresponding path program 2 times [2019-10-02 23:39:22,297 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:22,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:22,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:22,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:22,309 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:22,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:22,754 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-02 23:39:22,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 23:39:22,755 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 23:39:22,755 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-02 23:39:22,757 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-02 23:39:22,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 23:39:22,757 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 23:39:23,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 23:39:23,101 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-02 23:39:36,169 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 23:39:36,169 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 23:39:36,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 3674 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 23:39:36,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 23:39:36,561 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 23:39:36,564 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-02 23:39:37,191 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-02 23:39:37,240 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-02 23:39:37,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 5 [2019-10-02 23:39:37,240 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:37,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:39:37,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:39:37,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:39:37,243 INFO L87 Difference]: Start difference. First operand 5222 states and 6739 transitions. Second operand 4 states. [2019-10-02 23:39:41,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:41,839 INFO L93 Difference]: Finished difference Result 15568 states and 20103 transitions. [2019-10-02 23:39:41,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 23:39:41,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 358 [2019-10-02 23:39:41,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:41,938 INFO L225 Difference]: With dead ends: 15568 [2019-10-02 23:39:41,938 INFO L226 Difference]: Without dead ends: 15568 [2019-10-02 23:39:41,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 714 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:39:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15568 states. [2019-10-02 23:39:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15568 to 15554. [2019-10-02 23:39:42,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15554 states. [2019-10-02 23:39:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15554 states to 15554 states and 20091 transitions. [2019-10-02 23:39:42,554 INFO L78 Accepts]: Start accepts. Automaton has 15554 states and 20091 transitions. Word has length 358 [2019-10-02 23:39:42,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:42,555 INFO L475 AbstractCegarLoop]: Abstraction has 15554 states and 20091 transitions. [2019-10-02 23:39:42,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:39:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 15554 states and 20091 transitions. [2019-10-02 23:39:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2019-10-02 23:39:42,591 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:42,592 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:42,592 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:42,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:42,593 INFO L82 PathProgramCache]: Analyzing trace with hash -40941913, now seen corresponding path program 1 times [2019-10-02 23:39:42,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:42,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:42,608 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 23:39:42,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:42,608 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:43,082 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-02 23:39:43,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:43,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:39:43,083 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:43,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:39:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:39:43,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:39:43,084 INFO L87 Difference]: Start difference. First operand 15554 states and 20091 transitions. Second operand 5 states. [2019-10-02 23:39:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:44,121 INFO L93 Difference]: Finished difference Result 31144 states and 40223 transitions. [2019-10-02 23:39:44,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 23:39:44,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 358 [2019-10-02 23:39:44,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:44,366 INFO L225 Difference]: With dead ends: 31144 [2019-10-02 23:39:44,366 INFO L226 Difference]: Without dead ends: 31144 [2019-10-02 23:39:44,367 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:39:44,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31144 states. [2019-10-02 23:39:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31144 to 15570. [2019-10-02 23:39:45,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15570 states. [2019-10-02 23:39:45,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15570 states to 15570 states and 20107 transitions. [2019-10-02 23:39:45,177 INFO L78 Accepts]: Start accepts. Automaton has 15570 states and 20107 transitions. Word has length 358 [2019-10-02 23:39:45,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:45,177 INFO L475 AbstractCegarLoop]: Abstraction has 15570 states and 20107 transitions. [2019-10-02 23:39:45,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:39:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 15570 states and 20107 transitions. [2019-10-02 23:39:45,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-02 23:39:45,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:45,210 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:45,210 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:45,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:45,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1200937432, now seen corresponding path program 1 times [2019-10-02 23:39:45,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:45,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:45,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:45,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:45,225 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:45,596 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-10-02 23:39:45,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:45,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:45,597 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:45,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:45,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:45,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:45,599 INFO L87 Difference]: Start difference. First operand 15570 states and 20107 transitions. Second operand 3 states. [2019-10-02 23:39:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:48,249 INFO L93 Difference]: Finished difference Result 15570 states and 20083 transitions. [2019-10-02 23:39:48,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:48,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-10-02 23:39:48,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:48,324 INFO L225 Difference]: With dead ends: 15570 [2019-10-02 23:39:48,324 INFO L226 Difference]: Without dead ends: 15186 [2019-10-02 23:39:48,325 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:39:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15186 states. [2019-10-02 23:39:48,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15186 to 15090. [2019-10-02 23:39:48,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15090 states. [2019-10-02 23:39:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15090 states to 15090 states and 19468 transitions. [2019-10-02 23:39:48,693 INFO L78 Accepts]: Start accepts. Automaton has 15090 states and 19468 transitions. Word has length 374 [2019-10-02 23:39:48,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:48,694 INFO L475 AbstractCegarLoop]: Abstraction has 15090 states and 19468 transitions. [2019-10-02 23:39:48,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:48,694 INFO L276 IsEmpty]: Start isEmpty. Operand 15090 states and 19468 transitions. [2019-10-02 23:39:48,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2019-10-02 23:39:48,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:48,723 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:48,724 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:48,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:48,724 INFO L82 PathProgramCache]: Analyzing trace with hash -809334694, now seen corresponding path program 1 times [2019-10-02 23:39:48,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:48,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:48,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:48,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:48,738 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:48,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:49,267 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2019-10-02 23:39:49,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:49,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:49,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:49,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:49,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:49,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:49,270 INFO L87 Difference]: Start difference. First operand 15090 states and 19468 transitions. Second operand 3 states. [2019-10-02 23:39:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:51,863 INFO L93 Difference]: Finished difference Result 7361 states and 9505 transitions. [2019-10-02 23:39:51,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:51,864 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 374 [2019-10-02 23:39:51,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:51,896 INFO L225 Difference]: With dead ends: 7361 [2019-10-02 23:39:51,897 INFO L226 Difference]: Without dead ends: 7360 [2019-10-02 23:39:51,898 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:39:51,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7360 states. [2019-10-02 23:39:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7360 to 7360. [2019-10-02 23:39:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7360 states. [2019-10-02 23:39:52,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7360 states to 7360 states and 9504 transitions. [2019-10-02 23:39:52,047 INFO L78 Accepts]: Start accepts. Automaton has 7360 states and 9504 transitions. Word has length 374 [2019-10-02 23:39:52,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:52,047 INFO L475 AbstractCegarLoop]: Abstraction has 7360 states and 9504 transitions. [2019-10-02 23:39:52,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:52,048 INFO L276 IsEmpty]: Start isEmpty. Operand 7360 states and 9504 transitions. [2019-10-02 23:39:52,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2019-10-02 23:39:52,064 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:52,065 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:39:52,065 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:52,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1732086424, now seen corresponding path program 1 times [2019-10-02 23:39:52,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:52,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:52,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:52,079 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 300 trivial. 0 not checked. [2019-10-02 23:39:52,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:52,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:39:52,654 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:52,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:39:52,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:39:52,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:39:52,656 INFO L87 Difference]: Start difference. First operand 7360 states and 9504 transitions. Second operand 3 states. [2019-10-02 23:39:55,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:55,248 INFO L93 Difference]: Finished difference Result 7248 states and 9338 transitions. [2019-10-02 23:39:55,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:39:55,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 536 [2019-10-02 23:39:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:55,278 INFO L225 Difference]: With dead ends: 7248 [2019-10-02 23:39:55,279 INFO L226 Difference]: Without dead ends: 7248 [2019-10-02 23:39:55,279 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:39:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7248 states. [2019-10-02 23:39:55,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7248 to 7248. [2019-10-02 23:39:55,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7248 states. [2019-10-02 23:39:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7248 states to 7248 states and 9338 transitions. [2019-10-02 23:39:55,427 INFO L78 Accepts]: Start accepts. Automaton has 7248 states and 9338 transitions. Word has length 536 [2019-10-02 23:39:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:55,427 INFO L475 AbstractCegarLoop]: Abstraction has 7248 states and 9338 transitions. [2019-10-02 23:39:55,428 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:39:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 7248 states and 9338 transitions. [2019-10-02 23:39:55,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-10-02 23:39:55,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:55,440 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:55,440 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:55,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:55,441 INFO L82 PathProgramCache]: Analyzing trace with hash -270326811, now seen corresponding path program 1 times [2019-10-02 23:39:55,441 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:55,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:55,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:55,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:55,455 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:55,945 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-02 23:39:55,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:39:55,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 23:39:55,946 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:55,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 23:39:55,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 23:39:55,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:39:55,947 INFO L87 Difference]: Start difference. First operand 7248 states and 9338 transitions. Second operand 7 states. [2019-10-02 23:39:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:56,029 INFO L93 Difference]: Finished difference Result 7290 states and 9380 transitions. [2019-10-02 23:39:56,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 23:39:56,030 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 394 [2019-10-02 23:39:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:56,059 INFO L225 Difference]: With dead ends: 7290 [2019-10-02 23:39:56,060 INFO L226 Difference]: Without dead ends: 7290 [2019-10-02 23:39:56,060 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 23:39:56,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7290 states. [2019-10-02 23:39:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7290 to 7290. [2019-10-02 23:39:56,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7290 states. [2019-10-02 23:39:56,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7290 states to 7290 states and 9380 transitions. [2019-10-02 23:39:56,221 INFO L78 Accepts]: Start accepts. Automaton has 7290 states and 9380 transitions. Word has length 394 [2019-10-02 23:39:56,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:56,221 INFO L475 AbstractCegarLoop]: Abstraction has 7290 states and 9380 transitions. [2019-10-02 23:39:56,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 23:39:56,221 INFO L276 IsEmpty]: Start isEmpty. Operand 7290 states and 9380 transitions. [2019-10-02 23:39:56,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 421 [2019-10-02 23:39:56,235 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:39:56,235 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:56,235 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:39:56,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:56,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1548353486, now seen corresponding path program 1 times [2019-10-02 23:39:56,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:39:56,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:56,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:39:56,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:39:56,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:39:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:39:56,889 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-10-02 23:39:56,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 23:39:56,890 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 23:39:56,891 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 421 with the following transitions: [2019-10-02 23:39:56,894 INFO L207 CegarAbsIntRunner]: [4], [9], [11], [13], [15], [19], [21], [23], [24], [25], [27], [204], [216], [218], [219], [313], [317], [318], [387], [389], [391], [394], [397], [404], [405], [406], [408], [409], [624], [627], [629], [630], [635], [639], [641], [642], [645], [646], [647], [652], [655], [656], [704], [705], [762], [764], [765], [766], [767], [790], [792], [798], [799], [899], [904], [907], [909], [913], [915], [921], [927], [933], [935], [937], [939], [942], [1016], [1323], [1324], [1325], [1327], [1328], [1472], [1474], [1475], [1573], [1574], [1609], [1611], [1616], [1620], [1624], [1625], [1628], [1631], [1635], [1636], [1639], [1643], [1644], [1645], [1647], [1650], [1655], [1656], [1659], [1661], [1664], [1670], [1672], [1673], [1674], [1681], [1686], [1689], [1700], [1702], [1705], [1708], [1710], [1715], [1720], [1832], [1834], [1836], [1838], [1840], [1846], [1849], [1851], [1858], [1860], [1861], [1862], [1863], [1866], [1867], [1894], [1895], [1908], [1909], [1957], [1962], [1965], [1966], [2110], [2111], [2188], [2193], [2195], [2196], [2273], [2278], [2282], [2284], [2286], [2288], [2290], [2292], [2313], [2316], [2317], [2318], [2319], [2320], [2322], [2324], [2326], [2328], [2330], [2333], [2335], [2338], [2341], [2344], [2347], [2349], [2352], [2360], [2363], [2366], [2368], [2387], [2390], [2393], [2396], [2399], [2401], [2405], [2408], [2411], [2413], [2416], [2424], [2555], [2556], [2614], [2616], [2617], [2644], [2646], [2649], [2654], [2658], [2662], [2664], [2666], [2668], [2669], [2670], [2672], [2678], [2680], [2696], [2699], [2792], [2794], [2796], [2797], [2800], [2805], [2807], [2808], [2810], [2811], [2816], [2818], [2819], [2820], [2822], [2828], [2829], [2835], [2870], [2871], [2874], [2875], [2876], [2877], [2878], [2879], [2974], [2975], [2976], [2977], [2978], [2979], [3040], [3041], [3044], [3045], [3070], [3071], [3078], [3079], [3096], [3097], [3098], [3099], [3100], [3101], [3108], [3109], [3194], [3195], [3206], [3207], [3250], [3251], [3254], [3255], [3258], [3259], [3262], [3263], [3264], [3265], [3266], [3267], [3268], [3269], [3314], [3315], [3316], [3317], [3318], [3319], [3320], [3321], [3324], [3325], [3326], [3327], [3340], [3341], [3398], [3399], [3400], [3401], [3406], [3407], [3408], [3409], [3410], [3411], [3412], [3413], [3414], [3415], [3416], [3417], [3418], [3419], [3428], [3429], [3430], [3431], [3432], [3433], [3434], [3435], [3436], [3437], [3438], [3439], [3440], [3441], [3442], [3443], [3444], [3445], [3446], [3447], [3450], [3451], [3452], [3453], [3462], [3502], [3503], [3510], [3511], [3512], [3513], [3514], [3515], [3516], [3517], [3518], [3519], [3520], [3521], [3522], [3523], [3534], [3535], [3548], [3549], [3550], [3551], [3552], [3553], [3556], [3557], [3558], [3559], [3560], [3570], [3571], [3572] [2019-10-02 23:39:56,960 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 23:39:56,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 23:39:57,192 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 23:39:57,193 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 358 root evaluator evaluations with a maximum evaluation depth of 0. Performed 358 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 716 variables. [2019-10-02 23:39:57,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:39:57,198 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 23:39:57,328 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-02 23:39:57,329 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 23:39:57,336 INFO L420 sIntCurrentIteration]: We unified 419 AI predicates to 419 [2019-10-02 23:39:57,336 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 23:39:57,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 23:39:57,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 23:39:57,338 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:39:57,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 23:39:57,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 23:39:57,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 23:39:57,339 INFO L87 Difference]: Start difference. First operand 7290 states and 9380 transitions. Second operand 2 states. [2019-10-02 23:39:57,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:39:57,340 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-02 23:39:57,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 23:39:57,340 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 420 [2019-10-02 23:39:57,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:39:57,341 INFO L225 Difference]: With dead ends: 2 [2019-10-02 23:39:57,341 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 23:39:57,341 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 419 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:39:57,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 23:39:57,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 23:39:57,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 23:39:57,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 23:39:57,342 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 420 [2019-10-02 23:39:57,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:39:57,342 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 23:39:57,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 23:39:57,342 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 23:39:57,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 23:39:57,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:39:57 BoogieIcfgContainer [2019-10-02 23:39:57,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 23:39:57,350 INFO L168 Benchmark]: Toolchain (without parser) took 79077.92 ms. Allocated memory was 132.6 MB in the beginning and 1.5 GB in the end (delta: 1.3 GB). Free memory was 75.9 MB in the beginning and 939.0 MB in the end (delta: -863.1 MB). Peak memory consumption was 455.0 MB. Max. memory is 7.1 GB. [2019-10-02 23:39:57,351 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 132.6 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-02 23:39:57,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 3249.65 ms. Allocated memory was 132.6 MB in the beginning and 275.3 MB in the end (delta: 142.6 MB). Free memory was 75.7 MB in the beginning and 158.2 MB in the end (delta: -82.5 MB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. [2019-10-02 23:39:57,352 INFO L168 Benchmark]: Boogie Preprocessor took 360.87 ms. Allocated memory is still 275.3 MB. Free memory was 158.2 MB in the beginning and 128.3 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. [2019-10-02 23:39:57,353 INFO L168 Benchmark]: RCFGBuilder took 12592.60 ms. Allocated memory was 275.3 MB in the beginning and 532.2 MB in the end (delta: 256.9 MB). Free memory was 128.3 MB in the beginning and 402.5 MB in the end (delta: -274.2 MB). Peak memory consumption was 355.5 MB. Max. memory is 7.1 GB. [2019-10-02 23:39:57,354 INFO L168 Benchmark]: TraceAbstraction took 62870.09 ms. Allocated memory was 532.2 MB in the beginning and 1.5 GB in the end (delta: 918.6 MB). Free memory was 402.5 MB in the beginning and 939.0 MB in the end (delta: -536.5 MB). Peak memory consumption was 382.0 MB. Max. memory is 7.1 GB. [2019-10-02 23:39:57,358 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.19 ms. Allocated memory is still 132.6 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 3249.65 ms. Allocated memory was 132.6 MB in the beginning and 275.3 MB in the end (delta: 142.6 MB). Free memory was 75.7 MB in the beginning and 158.2 MB in the end (delta: -82.5 MB). Peak memory consumption was 123.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 360.87 ms. Allocated memory is still 275.3 MB. Free memory was 158.2 MB in the beginning and 128.3 MB in the end (delta: 29.9 MB). Peak memory consumption was 29.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 12592.60 ms. Allocated memory was 275.3 MB in the beginning and 532.2 MB in the end (delta: 256.9 MB). Free memory was 128.3 MB in the beginning and 402.5 MB in the end (delta: -274.2 MB). Peak memory consumption was 355.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 62870.09 ms. Allocated memory was 532.2 MB in the beginning and 1.5 GB in the end (delta: 918.6 MB). Free memory was 402.5 MB in the beginning and 939.0 MB in the end (delta: -536.5 MB). Peak memory consumption was 382.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6811]: 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 174 procedures, 1579 locations, 1 error locations. SAFE Result, 62.8s OverallTime, 26 OverallIterations, 9 TraceHistogramMax, 29.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 44962 SDtfs, 22633 SDslu, 66382 SDs, 0 SdLazy, 2056 SolverSat, 75 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 23.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1242 GetRequests, 1182 SyntacticMatches, 3 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15570occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.837708830548926 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 26 MinimizatonAttempts, 15820 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 16.0s SatisfiabilityAnalysisTime, 7.8s InterpolantComputationTime, 7180 NumberOfCodeBlocks, 6976 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 7510 ConstructedInterpolants, 0 QuantifiedInterpolants, 2968299 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3674 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 28 InterpolantComputations, 26 PerfectInterpolantSequences, 3505/3513 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...