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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 13:00:22,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 13:00:22,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 13:00:22,343 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 13:00:22,343 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 13:00:22,344 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 13:00:22,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 13:00:22,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 13:00:22,349 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 13:00:22,350 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 13:00:22,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 13:00:22,352 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 13:00:22,352 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 13:00:22,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 13:00:22,354 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 13:00:22,355 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 13:00:22,356 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 13:00:22,357 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 13:00:22,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 13:00:22,361 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 13:00:22,363 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 13:00:22,364 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 13:00:22,365 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 13:00:22,366 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 13:00:22,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 13:00:22,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 13:00:22,368 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 13:00:22,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 13:00:22,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 13:00:22,371 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 13:00:22,371 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 13:00:22,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 13:00:22,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 13:00:22,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 13:00:22,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 13:00:22,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 13:00:22,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 13:00:22,379 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 13:00:22,379 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 13:00:22,380 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 13:00:22,381 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 13:00:22,381 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-09-10 13:00:22,408 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 13:00:22,408 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 13:00:22,409 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 13:00:22,409 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 13:00:22,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 13:00:22,410 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 13:00:22,411 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 13:00:22,411 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 13:00:22,411 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 13:00:22,411 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 13:00:22,413 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 13:00:22,414 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 13:00:22,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 13:00:22,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 13:00:22,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 13:00:22,415 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 13:00:22,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 13:00:22,415 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 13:00:22,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 13:00:22,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 13:00:22,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 13:00:22,416 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 13:00:22,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 13:00:22,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 13:00:22,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 13:00:22,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 13:00:22,417 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 13:00:22,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 13:00:22,417 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 13:00:22,418 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 13:00:22,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 13:00:22,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 13:00:22,476 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 13:00:22,477 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 13:00:22,478 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 13:00:22,478 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2019-09-10 13:00:22,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c2cb1da/46a7f8cacb2d4e8aa62388881102b526/FLAGec094a4f8 [2019-09-10 13:00:23,344 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 13:00:23,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2019-09-10 13:00:23,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c2cb1da/46a7f8cacb2d4e8aa62388881102b526/FLAGec094a4f8 [2019-09-10 13:00:23,866 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c2cb1da/46a7f8cacb2d4e8aa62388881102b526 [2019-09-10 13:00:23,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 13:00:23,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 13:00:23,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 13:00:23,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 13:00:23,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 13:00:23,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:00:23" (1/1) ... [2019-09-10 13:00:23,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a37574f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:23, skipping insertion in model container [2019-09-10 13:00:23,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 01:00:23" (1/1) ... [2019-09-10 13:00:23,894 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 13:00:24,034 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 13:00:26,067 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 13:00:26,101 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 13:00:26,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 13:00:26,662 INFO L192 MainTranslator]: Completed translation [2019-09-10 13:00:26,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:26 WrapperNode [2019-09-10 13:00:26,664 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 13:00:26,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 13:00:26,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 13:00:26,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 13:00:26,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:26" (1/1) ... [2019-09-10 13:00:26,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:26" (1/1) ... [2019-09-10 13:00:26,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:26" (1/1) ... [2019-09-10 13:00:26,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:26" (1/1) ... [2019-09-10 13:00:26,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:26" (1/1) ... [2019-09-10 13:00:26,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:26" (1/1) ... [2019-09-10 13:00:27,032 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:26" (1/1) ... [2019-09-10 13:00:27,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 13:00:27,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 13:00:27,068 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 13:00:27,068 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 13:00:27,069 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 13:00:27,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 13:00:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 13:00:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~VOID [2019-09-10 13:00:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2019-09-10 13:00:27,160 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2019-09-10 13:00:27,160 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-10 13:00:27,160 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-09-10 13:00:27,160 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2019-09-10 13:00:27,161 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2019-09-10 13:00:27,161 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2019-09-10 13:00:27,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-10 13:00:27,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-10 13:00:27,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-09-10 13:00:27,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-09-10 13:00:27,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-10 13:00:27,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-10 13:00:27,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-10 13:00:27,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-10 13:00:27,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-10 13:00:27,168 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-09-10 13:00:27,168 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2019-09-10 13:00:27,168 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_irq [2019-09-10 13:00:27,168 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2019-09-10 13:00:27,168 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irq [2019-09-10 13:00:27,169 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-09-10 13:00:27,169 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work [2019-09-10 13:00:27,169 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_work [2019-09-10 13:00:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-10 13:00:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-10 13:00:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-10 13:00:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure kobject_name [2019-09-10 13:00:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-09-10 13:00:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-09-10 13:00:27,170 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-09-10 13:00:27,171 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2019-09-10 13:00:27,171 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2019-09-10 13:00:27,171 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_int [2019-09-10 13:00:27,171 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_is_int_in [2019-09-10 13:00:27,171 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2019-09-10 13:00:27,171 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_name [2019-09-10 13:00:27,171 INFO L138 BoogieDeclarations]: Found implementation of procedure pm_runtime_mark_last_busy [2019-09-10 13:00:27,172 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-10 13:00:27,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_mark_last_busy [2019-09-10 13:00:27,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2019-09-10 13:00:27,172 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2019-09-10 13:00:27,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-10 13:00:27,173 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2019-09-10 13:00:27,173 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2019-09-10 13:00:27,173 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device_by_minor [2019-09-10 13:00:27,173 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_out_callback [2019-09-10 13:00:27,173 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_in_callback [2019-09-10 13:00:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_int_callback [2019-09-10 13:00:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2019-09-10 13:00:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure free_urbs [2019-09-10 13:00:27,174 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-10 13:00:27,175 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_write [2019-09-10 13:00:27,175 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2019-09-10 13:00:27,175 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_read [2019-09-10 13:00:27,176 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_flush [2019-09-10 13:00:27,176 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_poll [2019-09-10 13:00:27,176 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_open [2019-09-10 13:00:27,177 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_release [2019-09-10 13:00:27,177 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2019-09-10 13:00:27,177 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_rxwork [2019-09-10 13:00:27,177 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2019-09-10 13:00:27,178 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_manage_power [2019-09-10 13:00:27,178 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_probe [2019-09-10 13:00:27,178 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_cdc_wdm_register [2019-09-10 13:00:27,178 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2019-09-10 13:00:27,179 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_suspend [2019-09-10 13:00:27,179 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2019-09-10 13:00:27,179 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2019-09-10 13:00:27,179 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_pre_reset [2019-09-10 13:00:27,180 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_post_reset [2019-09-10 13:00:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_driver_init [2019-09-10 13:00:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_driver_exit [2019-09-10 13:00:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_all_1 [2019-09-10 13:00:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure invoke_work_1 [2019-09-10 13:00:27,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_driver_2 [2019-09-10 13:00:27,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_file_operations_3 [2019-09-10 13:00:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure call_and_disable_work_1 [2019-09-10 13:00:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_work_1 [2019-09-10 13:00:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_work_1 [2019-09-10 13:00:27,183 INFO L138 BoogieDeclarations]: Found implementation of procedure work_init_1 [2019-09-10 13:00:27,184 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 13:00:27,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2019-09-10 13:00:27,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_5 [2019-09-10 13:00:27,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_6 [2019-09-10 13:00:27,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_work_on_7 [2019-09-10 13:00:27,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_flush_workqueue_8 [2019-09-10 13:00:27,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_queue_delayed_work_on_9 [2019-09-10 13:00:27,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_10 [2019-09-10 13:00:27,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-09-10 13:00:27,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_12 [2019-09-10 13:00:27,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_13 [2019-09-10 13:00:27,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_14 [2019-09-10 13:00:27,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_15 [2019-09-10 13:00:27,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_16 [2019-09-10 13:00:27,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_17 [2019-09-10 13:00:27,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_18 [2019-09-10 13:00:27,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_19 [2019-09-10 13:00:27,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_20 [2019-09-10 13:00:27,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_21 [2019-09-10 13:00:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_22 [2019-09-10 13:00:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_23 [2019-09-10 13:00:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_24 [2019-09-10 13:00:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_25 [2019-09-10 13:00:27,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_26 [2019-09-10 13:00:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_27 [2019-09-10 13:00:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_28 [2019-09-10 13:00:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_29 [2019-09-10 13:00:27,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_30 [2019-09-10 13:00:27,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_31 [2019-09-10 13:00:27,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_32 [2019-09-10 13:00:27,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_cancel_work_sync_33 [2019-09-10 13:00:27,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_34 [2019-09-10 13:00:27,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_35 [2019-09-10 13:00:27,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_36 [2019-09-10 13:00:27,193 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_37 [2019-09-10 13:00:27,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_38 [2019-09-10 13:00:27,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_cancel_work_sync_39 [2019-09-10 13:00:27,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_40 [2019-09-10 13:00:27,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_41 [2019-09-10 13:00:27,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_42 [2019-09-10 13:00:27,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_43 [2019-09-10 13:00:27,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_cancel_work_sync_44 [2019-09-10 13:00:27,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_45 [2019-09-10 13:00:27,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_46 [2019-09-10 13:00:27,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_register_driver_47 [2019-09-10 13:00:27,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_deregister_48 [2019-09-10 13:00:27,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-10 13:00:27,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2019-09-10 13:00:27,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-09-10 13:00:27,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-09-10 13:00:27,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-09-10 13:00:27,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-09-10 13:00:27,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_i_mutex_of_inode [2019-09-10 13:00:27,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_i_mutex_of_inode [2019-09-10 13:00:27,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_i_mutex_of_inode [2019-09-10 13:00:27,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_i_mutex_of_inode [2019-09-10 13:00:27,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_i_mutex_of_inode [2019-09-10 13:00:27,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_i_mutex_of_inode [2019-09-10 13:00:27,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_i_mutex_of_inode [2019-09-10 13:00:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_i_mutex_of_inode [2019-09-10 13:00:27,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_i_mutex_of_inode [2019-09-10 13:00:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_i_mutex_of_inode [2019-09-10 13:00:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_i_mutex_of_inode [2019-09-10 13:00:27,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-09-10 13:00:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-09-10 13:00:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-09-10 13:00:27,214 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-09-10 13:00:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-10 13:00:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-09-10 13:00:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-09-10 13:00:27,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_lock [2019-09-10 13:00:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_lock [2019-09-10 13:00:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_lock [2019-09-10 13:00:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_lock [2019-09-10 13:00:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-10 13:00:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-10 13:00:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-09-10 13:00:27,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-09-10 13:00:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-10 13:00:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-10 13:00:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-09-10 13:00:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mutex_of_device [2019-09-10 13:00:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mutex_of_device [2019-09-10 13:00:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-09-10 13:00:27,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mutex_of_device [2019-09-10 13:00:27,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_rlock_of_wdm_device [2019-09-10 13:00:27,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_rlock_of_wdm_device [2019-09-10 13:00:27,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_rlock_of_wdm_device [2019-09-10 13:00:27,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_rlock_of_wdm_device [2019-09-10 13:00:27,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_rlock_of_wdm_device [2019-09-10 13:00:27,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_rlock_of_wdm_device [2019-09-10 13:00:27,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_rlock_of_wdm_device [2019-09-10 13:00:27,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_rlock_of_wdm_device [2019-09-10 13:00:27,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_rlock_of_wdm_device [2019-09-10 13:00:27,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_rlock_of_wdm_device [2019-09-10 13:00:27,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_rlock_of_wdm_device [2019-09-10 13:00:27,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_wdm_mutex [2019-09-10 13:00:27,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_wdm_mutex [2019-09-10 13:00:27,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_wdm_mutex [2019-09-10 13:00:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_wdm_mutex [2019-09-10 13:00:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_wdm_mutex [2019-09-10 13:00:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_wdm_mutex [2019-09-10 13:00:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_wdm_mutex [2019-09-10 13:00:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_wdm_mutex [2019-09-10 13:00:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_wdm_mutex [2019-09-10 13:00:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_wdm_mutex [2019-09-10 13:00:27,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_wdm_mutex [2019-09-10 13:00:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_wlock_of_wdm_device [2019-09-10 13:00:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_wlock_of_wdm_device [2019-09-10 13:00:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_wlock_of_wdm_device [2019-09-10 13:00:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_wlock_of_wdm_device [2019-09-10 13:00:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_wlock_of_wdm_device [2019-09-10 13:00:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_wlock_of_wdm_device [2019-09-10 13:00:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_wlock_of_wdm_device [2019-09-10 13:00:27,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_wlock_of_wdm_device [2019-09-10 13:00:27,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_wlock_of_wdm_device [2019-09-10 13:00:27,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_wlock_of_wdm_device [2019-09-10 13:00:27,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_wlock_of_wdm_device [2019-09-10 13:00:27,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-10 13:00:27,222 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_from_user_overflow [2019-09-10 13:00:27,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_to_user_overflow [2019-09-10 13:00:27,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2019-09-10 13:00:27,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2019-09-10 13:00:27,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2019-09-10 13:00:27,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_work [2019-09-10 13:00:27,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __list_add [2019-09-10 13:00:27,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2019-09-10 13:00:27,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2019-09-10 13:00:27,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-09-10 13:00:27,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2019-09-10 13:00:27,225 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2019-09-10 13:00:27,225 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-09-10 13:00:27,225 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-09-10 13:00:27,225 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2019-09-10 13:00:27,225 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock [2019-09-10 13:00:27,225 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irq [2019-09-10 13:00:27,226 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-09-10 13:00:27,226 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock [2019-09-10 13:00:27,226 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irq [2019-09-10 13:00:27,226 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-09-10 13:00:27,226 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2019-09-10 13:00:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2019-09-10 13:00:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2019-09-10 13:00:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure flush_workqueue [2019-09-10 13:00:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-10 13:00:27,227 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2019-09-10 13:00:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2019-09-10 13:00:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-09-10 13:00:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2019-09-10 13:00:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-09-10 13:00:27,228 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-09-10 13:00:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-09-10 13:00:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2019-09-10 13:00:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_delayed_work_on [2019-09-10 13:00:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure queue_work_on [2019-09-10 13:00:27,229 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2019-09-10 13:00:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-09-10 13:00:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2019-09-10 13:00:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2019-09-10 13:00:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-10 13:00:27,230 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister_dev [2019-09-10 13:00:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-09-10 13:00:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-10 13:00:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_dev [2019-09-10 13:00:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-10 13:00:27,231 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-09-10 13:00:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-10 13:00:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-10 13:00:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-10 13:00:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-10 13:00:27,232 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memmove [2019-09-10 13:00:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 13:00:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-10 13:00:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2019-09-10 13:00:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-10 13:00:27,233 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-09-10 13:00:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2019-09-10 13:00:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 13:00:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2019-09-10 13:00:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2019-09-10 13:00:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2019-09-10 13:00:27,236 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2019-09-10 13:00:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-09-10 13:00:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2019-09-10 13:00:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 13:00:27,240 INFO L130 BoogieDeclarations]: Found specification of procedure __list_add [2019-09-10 13:00:27,241 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2019-09-10 13:00:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 13:00:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2019-09-10 13:00:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-10 13:00:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure memmove [2019-09-10 13:00:27,244 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2019-09-10 13:00:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2019-09-10 13:00:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-09-10 13:00:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-09-10 13:00:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_15 [2019-09-10 13:00:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-09-10 13:00:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-09-10 13:00:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_12 [2019-09-10 13:00:27,245 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_16 [2019-09-10 13:00:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_18 [2019-09-10 13:00:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_19 [2019-09-10 13:00:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_21 [2019-09-10 13:00:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_24 [2019-09-10 13:00:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_25 [2019-09-10 13:00:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_28 [2019-09-10 13:00:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_29 [2019-09-10 13:00:27,246 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_34 [2019-09-10 13:00:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_35 [2019-09-10 13:00:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_36 [2019-09-10 13:00:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_40 [2019-09-10 13:00:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_41 [2019-09-10 13:00:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_45 [2019-09-10 13:00:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_46 [2019-09-10 13:00:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 13:00:27,247 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-10 13:00:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 13:00:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-10 13:00:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-10 13:00:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 13:00:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-10 13:00:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 13:00:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-10 13:00:27,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-10 13:00:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-09-10 13:00:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-09-10 13:00:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-10 13:00:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-10 13:00:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-10 13:00:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-10 13:00:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-10 13:00:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2019-09-10 13:00:27,249 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_17 [2019-09-10 13:00:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_20 [2019-09-10 13:00:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-09-10 13:00:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_10 [2019-09-10 13:00:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_13 [2019-09-10 13:00:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_14 [2019-09-10 13:00:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_22 [2019-09-10 13:00:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_23 [2019-09-10 13:00:27,250 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_26 [2019-09-10 13:00:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_27 [2019-09-10 13:00:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_30 [2019-09-10 13:00:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_31 [2019-09-10 13:00:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_32 [2019-09-10 13:00:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_37 [2019-09-10 13:00:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_38 [2019-09-10 13:00:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_42 [2019-09-10 13:00:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_43 [2019-09-10 13:00:27,251 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_i_mutex_of_inode [2019-09-10 13:00:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_i_mutex_of_inode [2019-09-10 13:00:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-09-10 13:00:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-09-10 13:00:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-09-10 13:00:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-09-10 13:00:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-09-10 13:00:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_rlock_of_wdm_device [2019-09-10 13:00:27,252 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_rlock_of_wdm_device [2019-09-10 13:00:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_rlock_of_wdm_device [2019-09-10 13:00:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_wdm_mutex [2019-09-10 13:00:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_wdm_mutex [2019-09-10 13:00:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_wlock_of_wdm_device [2019-09-10 13:00:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_wlock_of_wdm_device [2019-09-10 13:00:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_wlock_of_wdm_device [2019-09-10 13:00:27,253 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2019-09-10 13:00:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock [2019-09-10 13:00:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irq [2019-09-10 13:00:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-09-10 13:00:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock [2019-09-10 13:00:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irq [2019-09-10 13:00:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-09-10 13:00:27,254 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-09-10 13:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2019-09-10 13:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_irq [2019-09-10 13:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2019-09-10 13:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irq [2019-09-10 13:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-09-10 13:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2019-09-10 13:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2019-09-10 13:00:27,255 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2019-09-10 13:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2019-09-10 13:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure __init_work [2019-09-10 13:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work_on [2019-09-10 13:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_5 [2019-09-10 13:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_work_on_7 [2019-09-10 13:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure queue_delayed_work_on [2019-09-10 13:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_6 [2019-09-10 13:00:27,256 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_queue_delayed_work_on_9 [2019-09-10 13:00:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure flush_workqueue [2019-09-10 13:00:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_flush_workqueue_8 [2019-09-10 13:00:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2019-09-10 13:00:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_cancel_work_sync_33 [2019-09-10 13:00:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_cancel_work_sync_39 [2019-09-10 13:00:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_cancel_work_sync_44 [2019-09-10 13:00:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure queue_work [2019-09-10 13:00:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_work [2019-09-10 13:00:27,257 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2019-09-10 13:00:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-10 13:00:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-10 13:00:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-10 13:00:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-10 13:00:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_all_1 [2019-09-10 13:00:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure invoke_work_1 [2019-09-10 13:00:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_driver_2 [2019-09-10 13:00:27,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_file_operations_3 [2019-09-10 13:00:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure call_and_disable_work_1 [2019-09-10 13:00:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure disable_work_1 [2019-09-10 13:00:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure activate_work_1 [2019-09-10 13:00:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure work_init_1 [2019-09-10 13:00:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure kobject_name [2019-09-10 13:00:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-09-10 13:00:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-09-10 13:00:27,259 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_from_user_overflow [2019-09-10 13:00:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_to_user_overflow [2019-09-10 13:00:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-09-10 13:00:27,260 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 13:00:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-09-10 13:00:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-09-10 13:00:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-09-10 13:00:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2019-09-10 13:00:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~$Pointer$~TO~VOID [2019-09-10 13:00:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2019-09-10 13:00:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_int [2019-09-10 13:00:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_is_int_in [2019-09-10 13:00:27,261 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2019-09-10 13:00:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure dev_name [2019-09-10 13:00:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2019-09-10 13:00:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2019-09-10 13:00:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure pm_runtime_mark_last_busy [2019-09-10 13:00:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 13:00:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-10 13:00:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2019-09-10 13:00:27,262 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2019-09-10 13:00:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure usb_mark_last_busy [2019-09-10 13:00:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-10 13:00:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_register_driver_47 [2019-09-10 13:00:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-10 13:00:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_deregister_48 [2019-09-10 13:00:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_dev [2019-09-10 13:00:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister_dev [2019-09-10 13:00:27,263 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2019-09-10 13:00:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2019-09-10 13:00:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-09-10 13:00:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-09-10 13:00:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-09-10 13:00:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-10 13:00:27,265 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-10 13:00:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2019-09-10 13:00:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure usb_cdc_wdm_register [2019-09-10 13:00:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2019-09-10 13:00:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device_by_minor [2019-09-10 13:00:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_out_callback [2019-09-10 13:00:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_in_callback [2019-09-10 13:00:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memmove [2019-09-10 13:00:27,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 13:00:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_int_callback [2019-09-10 13:00:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2019-09-10 13:00:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure free_urbs [2019-09-10 13:00:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-10 13:00:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_write [2019-09-10 13:00:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2019-09-10 13:00:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_read [2019-09-10 13:00:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_flush [2019-09-10 13:00:27,267 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_poll [2019-09-10 13:00:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_open [2019-09-10 13:00:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2019-09-10 13:00:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_release [2019-09-10 13:00:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2019-09-10 13:00:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_rxwork [2019-09-10 13:00:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2019-09-10 13:00:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_manage_power [2019-09-10 13:00:27,268 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_probe [2019-09-10 13:00:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2019-09-10 13:00:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_suspend [2019-09-10 13:00:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2019-09-10 13:00:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2019-09-10 13:00:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_pre_reset [2019-09-10 13:00:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_post_reset [2019-09-10 13:00:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_driver_init [2019-09-10 13:00:27,269 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_driver_exit [2019-09-10 13:00:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-10 13:00:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-10 13:00:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 13:00:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-10 13:00:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2019-09-10 13:00:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-09-10 13:00:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-09-10 13:00:27,270 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-09-10 13:00:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_i_mutex_of_inode [2019-09-10 13:00:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_i_mutex_of_inode [2019-09-10 13:00:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_i_mutex_of_inode [2019-09-10 13:00:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_i_mutex_of_inode [2019-09-10 13:00:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_i_mutex_of_inode [2019-09-10 13:00:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_i_mutex_of_inode [2019-09-10 13:00:27,271 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_i_mutex_of_inode [2019-09-10 13:00:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_i_mutex_of_inode [2019-09-10 13:00:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_i_mutex_of_inode [2019-09-10 13:00:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-09-10 13:00:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-09-10 13:00:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-09-10 13:00:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-10 13:00:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-09-10 13:00:27,272 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_lock [2019-09-10 13:00:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_lock [2019-09-10 13:00:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_lock [2019-09-10 13:00:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_lock [2019-09-10 13:00:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-10 13:00:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-10 13:00:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-10 13:00:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-10 13:00:27,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mutex_of_device [2019-09-10 13:00:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mutex_of_device [2019-09-10 13:00:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-09-10 13:00:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mutex_of_device [2019-09-10 13:00:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_rlock_of_wdm_device [2019-09-10 13:00:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_rlock_of_wdm_device [2019-09-10 13:00:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_rlock_of_wdm_device [2019-09-10 13:00:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_rlock_of_wdm_device [2019-09-10 13:00:27,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_rlock_of_wdm_device [2019-09-10 13:00:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_rlock_of_wdm_device [2019-09-10 13:00:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_rlock_of_wdm_device [2019-09-10 13:00:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_rlock_of_wdm_device [2019-09-10 13:00:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_wdm_mutex [2019-09-10 13:00:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_wdm_mutex [2019-09-10 13:00:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_wdm_mutex [2019-09-10 13:00:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_wdm_mutex [2019-09-10 13:00:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_wdm_mutex [2019-09-10 13:00:27,275 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_wdm_mutex [2019-09-10 13:00:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_wdm_mutex [2019-09-10 13:00:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_wdm_mutex [2019-09-10 13:00:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_wdm_mutex [2019-09-10 13:00:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_wlock_of_wdm_device [2019-09-10 13:00:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_wlock_of_wdm_device [2019-09-10 13:00:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_wlock_of_wdm_device [2019-09-10 13:00:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_wlock_of_wdm_device [2019-09-10 13:00:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_wlock_of_wdm_device [2019-09-10 13:00:27,276 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_wlock_of_wdm_device [2019-09-10 13:00:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_wlock_of_wdm_device [2019-09-10 13:00:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_wlock_of_wdm_device [2019-09-10 13:00:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 13:00:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-10 13:00:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-10 13:00:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 13:00:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 13:00:27,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 13:00:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-10 13:00:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 13:00:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-10 13:00:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-10 13:00:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-10 13:00:27,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-10 13:00:28,403 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-10 13:00:35,526 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 13:00:35,527 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 13:00:35,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:00:35 BoogieIcfgContainer [2019-09-10 13:00:35,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 13:00:35,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 13:00:35,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 13:00:35,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 13:00:35,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 01:00:23" (1/3) ... [2019-09-10 13:00:35,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4210adb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:00:35, skipping insertion in model container [2019-09-10 13:00:35,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 01:00:26" (2/3) ... [2019-09-10 13:00:35,537 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4210adb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 01:00:35, skipping insertion in model container [2019-09-10 13:00:35,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 01:00:35" (3/3) ... [2019-09-10 13:00:35,539 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--usb--class--cdc-wdm.ko-entry_point.cil.out.i [2019-09-10 13:00:35,549 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 13:00:35,564 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 13:00:35,583 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 13:00:35,615 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 13:00:35,615 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 13:00:35,615 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 13:00:35,615 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 13:00:35,616 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 13:00:35,616 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 13:00:35,616 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 13:00:35,616 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 13:00:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states. [2019-09-10 13:00:35,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-09-10 13:00:35,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:35,715 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:00:35,720 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:35,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1937319145, now seen corresponding path program 1 times [2019-09-10 13:00:35,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:35,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:35,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:35,821 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:36,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-10 13:00:36,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:36,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:36,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:36,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:36,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:36,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:36,848 INFO L87 Difference]: Start difference. First operand 1810 states. Second operand 3 states. [2019-09-10 13:00:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:37,428 INFO L93 Difference]: Finished difference Result 2064 states and 2661 transitions. [2019-09-10 13:00:37,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:37,430 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-09-10 13:00:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:37,461 INFO L225 Difference]: With dead ends: 2064 [2019-09-10 13:00:37,461 INFO L226 Difference]: Without dead ends: 2039 [2019-09-10 13:00:37,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:37,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2019-09-10 13:00:37,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2005. [2019-09-10 13:00:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-09-10 13:00:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2589 transitions. [2019-09-10 13:00:37,658 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2589 transitions. Word has length 212 [2019-09-10 13:00:37,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:37,659 INFO L475 AbstractCegarLoop]: Abstraction has 2005 states and 2589 transitions. [2019-09-10 13:00:37,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:37,659 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2589 transitions. [2019-09-10 13:00:37,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-09-10 13:00:37,667 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:37,668 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:00:37,668 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:37,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:37,668 INFO L82 PathProgramCache]: Analyzing trace with hash 779116830, now seen corresponding path program 1 times [2019-09-10 13:00:37,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:37,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:37,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:37,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:37,674 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:37,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-10 13:00:38,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:38,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:38,013 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:38,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:38,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:38,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:38,016 INFO L87 Difference]: Start difference. First operand 2005 states and 2589 transitions. Second operand 3 states. [2019-09-10 13:00:40,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:40,463 INFO L93 Difference]: Finished difference Result 3874 states and 5008 transitions. [2019-09-10 13:00:40,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:40,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-09-10 13:00:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:40,491 INFO L225 Difference]: With dead ends: 3874 [2019-09-10 13:00:40,491 INFO L226 Difference]: Without dead ends: 3874 [2019-09-10 13:00:40,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:40,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3874 states. [2019-09-10 13:00:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3874 to 3864. [2019-09-10 13:00:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3864 states. [2019-09-10 13:00:40,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3864 states to 3864 states and 4999 transitions. [2019-09-10 13:00:40,732 INFO L78 Accepts]: Start accepts. Automaton has 3864 states and 4999 transitions. Word has length 213 [2019-09-10 13:00:40,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:40,733 INFO L475 AbstractCegarLoop]: Abstraction has 3864 states and 4999 transitions. [2019-09-10 13:00:40,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:40,734 INFO L276 IsEmpty]: Start isEmpty. Operand 3864 states and 4999 transitions. [2019-09-10 13:00:40,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 13:00:40,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:40,738 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:00:40,738 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:40,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1362244001, now seen corresponding path program 1 times [2019-09-10 13:00:40,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:40,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:40,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:40,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:40,743 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:41,091 INFO L134 CoverageAnalysis]: Checked inductivity of 513 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2019-09-10 13:00:41,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:41,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:41,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:41,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:41,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:41,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:41,094 INFO L87 Difference]: Start difference. First operand 3864 states and 4999 transitions. Second operand 3 states. [2019-09-10 13:00:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:41,393 INFO L93 Difference]: Finished difference Result 5754 states and 7459 transitions. [2019-09-10 13:00:41,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:41,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 13:00:41,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:41,427 INFO L225 Difference]: With dead ends: 5754 [2019-09-10 13:00:41,427 INFO L226 Difference]: Without dead ends: 5754 [2019-09-10 13:00:41,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:41,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5754 states. [2019-09-10 13:00:41,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5754 to 5704. [2019-09-10 13:00:41,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2019-09-10 13:00:41,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 7399 transitions. [2019-09-10 13:00:41,659 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 7399 transitions. Word has length 239 [2019-09-10 13:00:41,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:41,660 INFO L475 AbstractCegarLoop]: Abstraction has 5704 states and 7399 transitions. [2019-09-10 13:00:41,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:41,660 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 7399 transitions. [2019-09-10 13:00:41,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-10 13:00:41,663 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:41,663 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:00:41,664 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:41,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:41,664 INFO L82 PathProgramCache]: Analyzing trace with hash 114190117, now seen corresponding path program 1 times [2019-09-10 13:00:41,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:41,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:41,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:41,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:41,668 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-10 13:00:42,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:42,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:42,066 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:42,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:42,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:42,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:42,068 INFO L87 Difference]: Start difference. First operand 5704 states and 7399 transitions. Second operand 3 states. [2019-09-10 13:00:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:42,148 INFO L93 Difference]: Finished difference Result 5703 states and 7397 transitions. [2019-09-10 13:00:42,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:42,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-09-10 13:00:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:42,194 INFO L225 Difference]: With dead ends: 5703 [2019-09-10 13:00:42,195 INFO L226 Difference]: Without dead ends: 5703 [2019-09-10 13:00:42,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:42,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5703 states. [2019-09-10 13:00:42,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5703 to 5703. [2019-09-10 13:00:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5703 states. [2019-09-10 13:00:43,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5703 states to 5703 states and 7397 transitions. [2019-09-10 13:00:43,128 INFO L78 Accepts]: Start accepts. Automaton has 5703 states and 7397 transitions. Word has length 234 [2019-09-10 13:00:43,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:43,128 INFO L475 AbstractCegarLoop]: Abstraction has 5703 states and 7397 transitions. [2019-09-10 13:00:43,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:43,129 INFO L276 IsEmpty]: Start isEmpty. Operand 5703 states and 7397 transitions. [2019-09-10 13:00:43,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-10 13:00:43,135 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:43,135 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:00:43,136 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:43,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:43,136 INFO L82 PathProgramCache]: Analyzing trace with hash -756013897, now seen corresponding path program 1 times [2019-09-10 13:00:43,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:43,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:43,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:43,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:43,148 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-10 13:00:43,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:43,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:43,537 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:43,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:43,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:43,540 INFO L87 Difference]: Start difference. First operand 5703 states and 7397 transitions. Second operand 3 states. [2019-09-10 13:00:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:43,598 INFO L93 Difference]: Finished difference Result 5702 states and 7395 transitions. [2019-09-10 13:00:43,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:43,599 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-09-10 13:00:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:43,639 INFO L225 Difference]: With dead ends: 5702 [2019-09-10 13:00:43,639 INFO L226 Difference]: Without dead ends: 5702 [2019-09-10 13:00:43,640 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5702 states. [2019-09-10 13:00:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5702 to 5702. [2019-09-10 13:00:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5702 states. [2019-09-10 13:00:43,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5702 states to 5702 states and 7395 transitions. [2019-09-10 13:00:43,829 INFO L78 Accepts]: Start accepts. Automaton has 5702 states and 7395 transitions. Word has length 235 [2019-09-10 13:00:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:43,829 INFO L475 AbstractCegarLoop]: Abstraction has 5702 states and 7395 transitions. [2019-09-10 13:00:43,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5702 states and 7395 transitions. [2019-09-10 13:00:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-09-10 13:00:43,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:43,834 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:00:43,835 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:43,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:43,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1962529688, now seen corresponding path program 1 times [2019-09-10 13:00:43,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:43,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:43,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:43,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:43,840 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:44,200 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-10 13:00:44,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:44,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:44,201 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:44,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:44,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:44,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:44,203 INFO L87 Difference]: Start difference. First operand 5702 states and 7395 transitions. Second operand 3 states. [2019-09-10 13:00:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:44,257 INFO L93 Difference]: Finished difference Result 5701 states and 7393 transitions. [2019-09-10 13:00:44,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:44,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 236 [2019-09-10 13:00:44,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:44,290 INFO L225 Difference]: With dead ends: 5701 [2019-09-10 13:00:44,291 INFO L226 Difference]: Without dead ends: 5701 [2019-09-10 13:00:44,291 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:44,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5701 states. [2019-09-10 13:00:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5701 to 5701. [2019-09-10 13:00:44,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5701 states. [2019-09-10 13:00:44,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 7393 transitions. [2019-09-10 13:00:44,468 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 7393 transitions. Word has length 236 [2019-09-10 13:00:44,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:44,469 INFO L475 AbstractCegarLoop]: Abstraction has 5701 states and 7393 transitions. [2019-09-10 13:00:44,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:44,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 7393 transitions. [2019-09-10 13:00:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-09-10 13:00:44,472 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:44,473 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:00:44,473 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:44,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:44,474 INFO L82 PathProgramCache]: Analyzing trace with hash -709808678, now seen corresponding path program 1 times [2019-09-10 13:00:44,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:44,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:44,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:44,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-10 13:00:45,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:45,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:45,039 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:45,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:45,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:45,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:45,041 INFO L87 Difference]: Start difference. First operand 5701 states and 7393 transitions. Second operand 3 states. [2019-09-10 13:00:45,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:45,198 INFO L93 Difference]: Finished difference Result 11001 states and 14295 transitions. [2019-09-10 13:00:45,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:45,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-09-10 13:00:45,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:45,267 INFO L225 Difference]: With dead ends: 11001 [2019-09-10 13:00:45,267 INFO L226 Difference]: Without dead ends: 11001 [2019-09-10 13:00:45,268 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:45,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11001 states. [2019-09-10 13:00:45,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11001 to 10953. [2019-09-10 13:00:45,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10953 states. [2019-09-10 13:00:45,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10953 states to 10953 states and 14245 transitions. [2019-09-10 13:00:45,638 INFO L78 Accepts]: Start accepts. Automaton has 10953 states and 14245 transitions. Word has length 237 [2019-09-10 13:00:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:45,639 INFO L475 AbstractCegarLoop]: Abstraction has 10953 states and 14245 transitions. [2019-09-10 13:00:45,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 10953 states and 14245 transitions. [2019-09-10 13:00:45,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-09-10 13:00:45,646 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:45,646 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:00:45,647 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:45,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:45,647 INFO L82 PathProgramCache]: Analyzing trace with hash -530158165, now seen corresponding path program 1 times [2019-09-10 13:00:45,648 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:45,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:45,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:45,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:45,652 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-10 13:00:46,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:46,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:46,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:46,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:46,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:46,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:46,006 INFO L87 Difference]: Start difference. First operand 10953 states and 14245 transitions. Second operand 3 states. [2019-09-10 13:00:46,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:46,113 INFO L93 Difference]: Finished difference Result 12009 states and 15235 transitions. [2019-09-10 13:00:46,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:46,113 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-09-10 13:00:46,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:46,160 INFO L225 Difference]: With dead ends: 12009 [2019-09-10 13:00:46,160 INFO L226 Difference]: Without dead ends: 12009 [2019-09-10 13:00:46,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12009 states. [2019-09-10 13:00:46,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12009 to 12003. [2019-09-10 13:00:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12003 states. [2019-09-10 13:00:46,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12003 states to 12003 states and 15230 transitions. [2019-09-10 13:00:46,507 INFO L78 Accepts]: Start accepts. Automaton has 12003 states and 15230 transitions. Word has length 238 [2019-09-10 13:00:46,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:46,508 INFO L475 AbstractCegarLoop]: Abstraction has 12003 states and 15230 transitions. [2019-09-10 13:00:46,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:46,508 INFO L276 IsEmpty]: Start isEmpty. Operand 12003 states and 15230 transitions. [2019-09-10 13:00:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-09-10 13:00:46,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:46,512 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:00:46,513 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:46,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:46,514 INFO L82 PathProgramCache]: Analyzing trace with hash 744045309, now seen corresponding path program 1 times [2019-09-10 13:00:46,514 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:46,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:46,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:46,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:46,518 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-10 13:00:47,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:47,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:47,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:47,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:47,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:47,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:47,167 INFO L87 Difference]: Start difference. First operand 12003 states and 15230 transitions. Second operand 3 states. [2019-09-10 13:00:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:47,370 INFO L93 Difference]: Finished difference Result 22034 states and 28165 transitions. [2019-09-10 13:00:47,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:47,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 239 [2019-09-10 13:00:47,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:47,461 INFO L225 Difference]: With dead ends: 22034 [2019-09-10 13:00:47,462 INFO L226 Difference]: Without dead ends: 22014 [2019-09-10 13:00:47,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:47,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22014 states. [2019-09-10 13:00:47,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22014 to 21821. [2019-09-10 13:00:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21821 states. [2019-09-10 13:00:48,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21821 states to 21821 states and 27931 transitions. [2019-09-10 13:00:48,078 INFO L78 Accepts]: Start accepts. Automaton has 21821 states and 27931 transitions. Word has length 239 [2019-09-10 13:00:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:48,079 INFO L475 AbstractCegarLoop]: Abstraction has 21821 states and 27931 transitions. [2019-09-10 13:00:48,079 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:48,079 INFO L276 IsEmpty]: Start isEmpty. Operand 21821 states and 27931 transitions. [2019-09-10 13:00:48,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2019-09-10 13:00:48,091 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:48,091 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2019-09-10 13:00:48,092 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:48,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:48,092 INFO L82 PathProgramCache]: Analyzing trace with hash -736606627, now seen corresponding path program 1 times [2019-09-10 13:00:48,093 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:48,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:48,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:48,098 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:48,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-10 13:00:48,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:48,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:48,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:48,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:48,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:48,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:48,511 INFO L87 Difference]: Start difference. First operand 21821 states and 27931 transitions. Second operand 3 states. [2019-09-10 13:00:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:51,207 INFO L93 Difference]: Finished difference Result 32426 states and 41187 transitions. [2019-09-10 13:00:51,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:51,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 303 [2019-09-10 13:00:51,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:51,335 INFO L225 Difference]: With dead ends: 32426 [2019-09-10 13:00:51,335 INFO L226 Difference]: Without dead ends: 32426 [2019-09-10 13:00:51,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32426 states. [2019-09-10 13:00:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32426 to 32331. [2019-09-10 13:00:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32331 states. [2019-09-10 13:00:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32331 states to 32331 states and 41090 transitions. [2019-09-10 13:00:52,196 INFO L78 Accepts]: Start accepts. Automaton has 32331 states and 41090 transitions. Word has length 303 [2019-09-10 13:00:52,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:52,197 INFO L475 AbstractCegarLoop]: Abstraction has 32331 states and 41090 transitions. [2019-09-10 13:00:52,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:52,197 INFO L276 IsEmpty]: Start isEmpty. Operand 32331 states and 41090 transitions. [2019-09-10 13:00:52,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-09-10 13:00:52,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:52,207 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2019-09-10 13:00:52,207 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:52,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:52,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1169932098, now seen corresponding path program 1 times [2019-09-10 13:00:52,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:52,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:52,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:52,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:52,213 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:52,569 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-09-10 13:00:52,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:52,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:52,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:52,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:52,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:52,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:52,571 INFO L87 Difference]: Start difference. First operand 32331 states and 41090 transitions. Second operand 3 states. [2019-09-10 13:00:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:54,982 INFO L93 Difference]: Finished difference Result 16630 states and 21093 transitions. [2019-09-10 13:00:54,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:54,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-09-10 13:00:54,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:55,043 INFO L225 Difference]: With dead ends: 16630 [2019-09-10 13:00:55,043 INFO L226 Difference]: Without dead ends: 16627 [2019-09-10 13:00:55,044 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:55,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16627 states. [2019-09-10 13:00:55,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16627 to 16344. [2019-09-10 13:00:55,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2019-09-10 13:00:55,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 20793 transitions. [2019-09-10 13:00:55,372 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 20793 transitions. Word has length 307 [2019-09-10 13:00:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:55,372 INFO L475 AbstractCegarLoop]: Abstraction has 16344 states and 20793 transitions. [2019-09-10 13:00:55,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:55,373 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 20793 transitions. [2019-09-10 13:00:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-09-10 13:00:55,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:55,387 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:00:55,387 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:55,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:55,388 INFO L82 PathProgramCache]: Analyzing trace with hash -861206498, now seen corresponding path program 1 times [2019-09-10 13:00:55,388 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:55,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:55,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:55,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:55,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:55,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:56,752 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-10 13:00:56,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:56,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:56,753 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:56,754 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:56,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:56,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:56,757 INFO L87 Difference]: Start difference. First operand 16344 states and 20793 transitions. Second operand 3 states. [2019-09-10 13:00:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:00:59,188 INFO L93 Difference]: Finished difference Result 16349 states and 20784 transitions. [2019-09-10 13:00:59,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:00:59,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 321 [2019-09-10 13:00:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:00:59,245 INFO L225 Difference]: With dead ends: 16349 [2019-09-10 13:00:59,246 INFO L226 Difference]: Without dead ends: 16349 [2019-09-10 13:00:59,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:59,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16349 states. [2019-09-10 13:00:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16349 to 16343. [2019-09-10 13:00:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16343 states. [2019-09-10 13:00:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16343 states to 16343 states and 20779 transitions. [2019-09-10 13:00:59,553 INFO L78 Accepts]: Start accepts. Automaton has 16343 states and 20779 transitions. Word has length 321 [2019-09-10 13:00:59,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:00:59,554 INFO L475 AbstractCegarLoop]: Abstraction has 16343 states and 20779 transitions. [2019-09-10 13:00:59,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:00:59,554 INFO L276 IsEmpty]: Start isEmpty. Operand 16343 states and 20779 transitions. [2019-09-10 13:00:59,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-10 13:00:59,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:00:59,570 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2019-09-10 13:00:59,570 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:00:59,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:00:59,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1791999939, now seen corresponding path program 1 times [2019-09-10 13:00:59,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:00:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:59,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:00:59,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:00:59,577 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:00:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:00:59,926 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2019-09-10 13:00:59,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:00:59,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:00:59,927 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:00:59,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:00:59,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:00:59,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:00:59,928 INFO L87 Difference]: Start difference. First operand 16343 states and 20779 transitions. Second operand 3 states. [2019-09-10 13:01:02,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:02,360 INFO L93 Difference]: Finished difference Result 21967 states and 27903 transitions. [2019-09-10 13:01:02,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:01:02,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 333 [2019-09-10 13:01:02,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:02,429 INFO L225 Difference]: With dead ends: 21967 [2019-09-10 13:01:02,429 INFO L226 Difference]: Without dead ends: 21967 [2019-09-10 13:01:02,430 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:01:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21967 states. [2019-09-10 13:01:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21967 to 21851. [2019-09-10 13:01:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21851 states. [2019-09-10 13:01:02,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21851 states to 21851 states and 27770 transitions. [2019-09-10 13:01:02,867 INFO L78 Accepts]: Start accepts. Automaton has 21851 states and 27770 transitions. Word has length 333 [2019-09-10 13:01:02,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:02,868 INFO L475 AbstractCegarLoop]: Abstraction has 21851 states and 27770 transitions. [2019-09-10 13:01:02,868 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:01:02,868 INFO L276 IsEmpty]: Start isEmpty. Operand 21851 states and 27770 transitions. [2019-09-10 13:01:02,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2019-09-10 13:01:02,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:02,882 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:02,882 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:02,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:02,882 INFO L82 PathProgramCache]: Analyzing trace with hash -971694620, now seen corresponding path program 1 times [2019-09-10 13:01:02,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:02,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:02,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:02,886 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:03,592 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-10 13:01:03,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:03,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 13:01:03,593 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:03,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 13:01:03,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 13:01:03,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 13:01:03,595 INFO L87 Difference]: Start difference. First operand 21851 states and 27770 transitions. Second operand 6 states. [2019-09-10 13:01:06,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:06,269 INFO L93 Difference]: Finished difference Result 30353 states and 38452 transitions. [2019-09-10 13:01:06,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 13:01:06,270 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 349 [2019-09-10 13:01:06,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:06,367 INFO L225 Difference]: With dead ends: 30353 [2019-09-10 13:01:06,367 INFO L226 Difference]: Without dead ends: 30353 [2019-09-10 13:01:06,370 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 13:01:06,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30353 states. [2019-09-10 13:01:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30353 to 21911. [2019-09-10 13:01:06,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21911 states. [2019-09-10 13:01:06,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21911 states to 21911 states and 27830 transitions. [2019-09-10 13:01:06,901 INFO L78 Accepts]: Start accepts. Automaton has 21911 states and 27830 transitions. Word has length 349 [2019-09-10 13:01:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:06,902 INFO L475 AbstractCegarLoop]: Abstraction has 21911 states and 27830 transitions. [2019-09-10 13:01:06,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 13:01:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 21911 states and 27830 transitions. [2019-09-10 13:01:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-10 13:01:06,908 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:06,908 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:06,909 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:06,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:06,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1681577484, now seen corresponding path program 1 times [2019-09-10 13:01:06,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:06,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:06,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:06,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:06,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:07,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:07,376 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-10 13:01:07,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:07,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:01:07,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:07,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:01:07,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:01:07,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:01:07,378 INFO L87 Difference]: Start difference. First operand 21911 states and 27830 transitions. Second operand 3 states. [2019-09-10 13:01:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:09,913 INFO L93 Difference]: Finished difference Result 21926 states and 27664 transitions. [2019-09-10 13:01:09,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:01:09,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 357 [2019-09-10 13:01:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:09,973 INFO L225 Difference]: With dead ends: 21926 [2019-09-10 13:01:09,973 INFO L226 Difference]: Without dead ends: 21926 [2019-09-10 13:01:09,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:01:09,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21926 states. [2019-09-10 13:01:10,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21926 to 21765. [2019-09-10 13:01:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-09-10 13:01:10,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 27503 transitions. [2019-09-10 13:01:10,398 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 27503 transitions. Word has length 357 [2019-09-10 13:01:10,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:10,399 INFO L475 AbstractCegarLoop]: Abstraction has 21765 states and 27503 transitions. [2019-09-10 13:01:10,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:01:10,399 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 27503 transitions. [2019-09-10 13:01:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-10 13:01:10,406 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:10,406 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:10,406 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:10,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:10,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1470226571, now seen corresponding path program 1 times [2019-09-10 13:01:10,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:10,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:10,410 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:10,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:10,410 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:10,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-10 13:01:11,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:11,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 13:01:11,261 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:11,261 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 13:01:11,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 13:01:11,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 13:01:11,262 INFO L87 Difference]: Start difference. First operand 21765 states and 27503 transitions. Second operand 9 states. [2019-09-10 13:01:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:11,440 INFO L93 Difference]: Finished difference Result 22133 states and 27963 transitions. [2019-09-10 13:01:11,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 13:01:11,441 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 357 [2019-09-10 13:01:11,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:11,510 INFO L225 Difference]: With dead ends: 22133 [2019-09-10 13:01:11,510 INFO L226 Difference]: Without dead ends: 22133 [2019-09-10 13:01:11,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 13:01:11,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22133 states. [2019-09-10 13:01:11,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22133 to 22053. [2019-09-10 13:01:11,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22053 states. [2019-09-10 13:01:11,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22053 states to 22053 states and 27851 transitions. [2019-09-10 13:01:11,934 INFO L78 Accepts]: Start accepts. Automaton has 22053 states and 27851 transitions. Word has length 357 [2019-09-10 13:01:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:11,934 INFO L475 AbstractCegarLoop]: Abstraction has 22053 states and 27851 transitions. [2019-09-10 13:01:11,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 13:01:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 22053 states and 27851 transitions. [2019-09-10 13:01:11,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2019-09-10 13:01:11,942 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:11,942 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:11,943 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:11,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:11,943 INFO L82 PathProgramCache]: Analyzing trace with hash -2078303434, now seen corresponding path program 1 times [2019-09-10 13:01:11,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:11,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:11,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:11,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:11,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 732 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-10 13:01:12,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:12,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 13:01:12,456 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:12,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 13:01:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 13:01:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 13:01:12,457 INFO L87 Difference]: Start difference. First operand 22053 states and 27851 transitions. Second operand 7 states. [2019-09-10 13:01:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:12,623 INFO L93 Difference]: Finished difference Result 21494 states and 27002 transitions. [2019-09-10 13:01:12,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 13:01:12,624 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 357 [2019-09-10 13:01:12,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:12,687 INFO L225 Difference]: With dead ends: 21494 [2019-09-10 13:01:12,687 INFO L226 Difference]: Without dead ends: 21494 [2019-09-10 13:01:12,688 INFO L628 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-09-10 13:01:12,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21494 states. [2019-09-10 13:01:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21494 to 21398. [2019-09-10 13:01:13,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21398 states. [2019-09-10 13:01:13,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21398 states to 21398 states and 26870 transitions. [2019-09-10 13:01:13,084 INFO L78 Accepts]: Start accepts. Automaton has 21398 states and 26870 transitions. Word has length 357 [2019-09-10 13:01:13,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:13,085 INFO L475 AbstractCegarLoop]: Abstraction has 21398 states and 26870 transitions. [2019-09-10 13:01:13,085 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 13:01:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 21398 states and 26870 transitions. [2019-09-10 13:01:13,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-10 13:01:13,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:13,096 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 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] [2019-09-10 13:01:13,097 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:13,097 INFO L82 PathProgramCache]: Analyzing trace with hash -161783020, now seen corresponding path program 1 times [2019-09-10 13:01:13,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:13,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:13,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:13,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:13,102 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 740 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-10 13:01:13,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:13,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 13:01:13,470 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:13,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 13:01:13,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 13:01:13,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 13:01:13,472 INFO L87 Difference]: Start difference. First operand 21398 states and 26870 transitions. Second operand 7 states. [2019-09-10 13:01:13,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:13,716 INFO L93 Difference]: Finished difference Result 21458 states and 26930 transitions. [2019-09-10 13:01:13,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 13:01:13,717 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 381 [2019-09-10 13:01:13,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:13,771 INFO L225 Difference]: With dead ends: 21458 [2019-09-10 13:01:13,771 INFO L226 Difference]: Without dead ends: 21458 [2019-09-10 13:01:13,772 INFO L628 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-09-10 13:01:13,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21458 states. [2019-09-10 13:01:14,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21458 to 21350. [2019-09-10 13:01:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2019-09-10 13:01:14,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 26786 transitions. [2019-09-10 13:01:14,175 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 26786 transitions. Word has length 381 [2019-09-10 13:01:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:14,176 INFO L475 AbstractCegarLoop]: Abstraction has 21350 states and 26786 transitions. [2019-09-10 13:01:14,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 13:01:14,176 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 26786 transitions. [2019-09-10 13:01:14,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2019-09-10 13:01:14,188 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:14,188 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:14,188 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:14,189 INFO L82 PathProgramCache]: Analyzing trace with hash -478182676, now seen corresponding path program 1 times [2019-09-10 13:01:14,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:14,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:14,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:14,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:14,194 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-10 13:01:14,693 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:14,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 13:01:14,693 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:14,694 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 13:01:14,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 13:01:14,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 13:01:14,695 INFO L87 Difference]: Start difference. First operand 21350 states and 26786 transitions. Second operand 9 states. [2019-09-10 13:01:17,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:17,796 INFO L93 Difference]: Finished difference Result 29950 states and 37538 transitions. [2019-09-10 13:01:17,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 13:01:17,796 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 379 [2019-09-10 13:01:17,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:17,850 INFO L225 Difference]: With dead ends: 29950 [2019-09-10 13:01:17,850 INFO L226 Difference]: Without dead ends: 29950 [2019-09-10 13:01:17,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-09-10 13:01:17,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29950 states. [2019-09-10 13:01:18,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29950 to 21458. [2019-09-10 13:01:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21458 states. [2019-09-10 13:01:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21458 states to 21458 states and 26942 transitions. [2019-09-10 13:01:18,305 INFO L78 Accepts]: Start accepts. Automaton has 21458 states and 26942 transitions. Word has length 379 [2019-09-10 13:01:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:18,306 INFO L475 AbstractCegarLoop]: Abstraction has 21458 states and 26942 transitions. [2019-09-10 13:01:18,306 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 13:01:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 21458 states and 26942 transitions. [2019-09-10 13:01:18,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-10 13:01:18,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:18,314 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:18,315 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:18,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:18,315 INFO L82 PathProgramCache]: Analyzing trace with hash 257121958, now seen corresponding path program 1 times [2019-09-10 13:01:18,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:18,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:18,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:18,318 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:18,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 742 trivial. 0 not checked. [2019-09-10 13:01:18,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:18,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:01:18,644 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:18,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:01:18,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:01:18,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:01:18,645 INFO L87 Difference]: Start difference. First operand 21458 states and 26942 transitions. Second operand 3 states. [2019-09-10 13:01:21,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:21,048 INFO L93 Difference]: Finished difference Result 16823 states and 20811 transitions. [2019-09-10 13:01:21,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:01:21,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 380 [2019-09-10 13:01:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:21,084 INFO L225 Difference]: With dead ends: 16823 [2019-09-10 13:01:21,084 INFO L226 Difference]: Without dead ends: 16823 [2019-09-10 13:01:21,085 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:01:21,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16823 states. [2019-09-10 13:01:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16823 to 16547. [2019-09-10 13:01:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16547 states. [2019-09-10 13:01:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16547 states to 16547 states and 20529 transitions. [2019-09-10 13:01:21,513 INFO L78 Accepts]: Start accepts. Automaton has 16547 states and 20529 transitions. Word has length 380 [2019-09-10 13:01:21,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:21,515 INFO L475 AbstractCegarLoop]: Abstraction has 16547 states and 20529 transitions. [2019-09-10 13:01:21,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:01:21,515 INFO L276 IsEmpty]: Start isEmpty. Operand 16547 states and 20529 transitions. [2019-09-10 13:01:21,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2019-09-10 13:01:21,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:21,527 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:21,527 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:21,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:21,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1780934331, now seen corresponding path program 1 times [2019-09-10 13:01:21,528 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:21,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:21,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:21,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:21,531 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 732 trivial. 0 not checked. [2019-09-10 13:01:21,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:21,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 13:01:21,939 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:21,939 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 13:01:21,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 13:01:21,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 13:01:21,940 INFO L87 Difference]: Start difference. First operand 16547 states and 20529 transitions. Second operand 6 states. [2019-09-10 13:01:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:24,409 INFO L93 Difference]: Finished difference Result 23121 states and 28520 transitions. [2019-09-10 13:01:24,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 13:01:24,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 380 [2019-09-10 13:01:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:24,451 INFO L225 Difference]: With dead ends: 23121 [2019-09-10 13:01:24,452 INFO L226 Difference]: Without dead ends: 23121 [2019-09-10 13:01:24,452 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 13:01:24,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23121 states. [2019-09-10 13:01:24,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23121 to 16601. [2019-09-10 13:01:24,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16601 states. [2019-09-10 13:01:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16601 states to 16601 states and 20592 transitions. [2019-09-10 13:01:24,729 INFO L78 Accepts]: Start accepts. Automaton has 16601 states and 20592 transitions. Word has length 380 [2019-09-10 13:01:24,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:24,729 INFO L475 AbstractCegarLoop]: Abstraction has 16601 states and 20592 transitions. [2019-09-10 13:01:24,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 13:01:24,729 INFO L276 IsEmpty]: Start isEmpty. Operand 16601 states and 20592 transitions. [2019-09-10 13:01:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-09-10 13:01:24,736 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:24,737 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:24,737 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:24,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1568324465, now seen corresponding path program 1 times [2019-09-10 13:01:24,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:24,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:24,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:24,740 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:24,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:25,142 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-09-10 13:01:25,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:25,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 13:01:25,143 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:25,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 13:01:25,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 13:01:25,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 13:01:25,144 INFO L87 Difference]: Start difference. First operand 16601 states and 20592 transitions. Second operand 6 states. [2019-09-10 13:01:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:25,276 INFO L93 Difference]: Finished difference Result 16691 states and 20700 transitions. [2019-09-10 13:01:25,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 13:01:25,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 392 [2019-09-10 13:01:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:25,320 INFO L225 Difference]: With dead ends: 16691 [2019-09-10 13:01:25,321 INFO L226 Difference]: Without dead ends: 16691 [2019-09-10 13:01:25,321 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 13:01:25,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16691 states. [2019-09-10 13:01:25,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16691 to 16655. [2019-09-10 13:01:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16655 states. [2019-09-10 13:01:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16655 states to 16655 states and 20655 transitions. [2019-09-10 13:01:25,557 INFO L78 Accepts]: Start accepts. Automaton has 16655 states and 20655 transitions. Word has length 392 [2019-09-10 13:01:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:25,558 INFO L475 AbstractCegarLoop]: Abstraction has 16655 states and 20655 transitions. [2019-09-10 13:01:25,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 13:01:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 16655 states and 20655 transitions. [2019-09-10 13:01:25,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-09-10 13:01:25,563 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:25,563 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:25,564 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:25,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:25,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1444147086, now seen corresponding path program 1 times [2019-09-10 13:01:25,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:25,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:25,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:25,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:25,568 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2019-09-10 13:01:25,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:25,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 13:01:25,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:25,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 13:01:25,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 13:01:25,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 13:01:25,964 INFO L87 Difference]: Start difference. First operand 16655 states and 20655 transitions. Second operand 6 states. [2019-09-10 13:01:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:28,587 INFO L93 Difference]: Finished difference Result 23295 states and 28721 transitions. [2019-09-10 13:01:28,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 13:01:28,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 394 [2019-09-10 13:01:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:28,845 INFO L225 Difference]: With dead ends: 23295 [2019-09-10 13:01:28,845 INFO L226 Difference]: Without dead ends: 23295 [2019-09-10 13:01:28,846 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-09-10 13:01:28,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23295 states. [2019-09-10 13:01:29,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23295 to 16637. [2019-09-10 13:01:29,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16637 states. [2019-09-10 13:01:29,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16637 states to 16637 states and 20631 transitions. [2019-09-10 13:01:29,097 INFO L78 Accepts]: Start accepts. Automaton has 16637 states and 20631 transitions. Word has length 394 [2019-09-10 13:01:29,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:29,097 INFO L475 AbstractCegarLoop]: Abstraction has 16637 states and 20631 transitions. [2019-09-10 13:01:29,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 13:01:29,098 INFO L276 IsEmpty]: Start isEmpty. Operand 16637 states and 20631 transitions. [2019-09-10 13:01:29,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2019-09-10 13:01:29,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:29,105 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:29,105 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:29,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:29,105 INFO L82 PathProgramCache]: Analyzing trace with hash 811445016, now seen corresponding path program 1 times [2019-09-10 13:01:29,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:29,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:29,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:29,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:29,109 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:29,511 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2019-09-10 13:01:29,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:29,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 13:01:29,512 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:29,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 13:01:29,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 13:01:29,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 13:01:29,515 INFO L87 Difference]: Start difference. First operand 16637 states and 20631 transitions. Second operand 7 states. [2019-09-10 13:01:29,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:29,664 INFO L93 Difference]: Finished difference Result 16342 states and 20174 transitions. [2019-09-10 13:01:29,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 13:01:29,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 432 [2019-09-10 13:01:29,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:29,708 INFO L225 Difference]: With dead ends: 16342 [2019-09-10 13:01:29,708 INFO L226 Difference]: Without dead ends: 16342 [2019-09-10 13:01:29,713 INFO L628 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-09-10 13:01:29,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16342 states. [2019-09-10 13:01:29,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16342 to 16330. [2019-09-10 13:01:29,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16330 states. [2019-09-10 13:01:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16330 states to 16330 states and 20159 transitions. [2019-09-10 13:01:29,996 INFO L78 Accepts]: Start accepts. Automaton has 16330 states and 20159 transitions. Word has length 432 [2019-09-10 13:01:29,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:29,997 INFO L475 AbstractCegarLoop]: Abstraction has 16330 states and 20159 transitions. [2019-09-10 13:01:29,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 13:01:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 16330 states and 20159 transitions. [2019-09-10 13:01:30,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2019-09-10 13:01:30,006 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:30,008 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 4, 4, 3, 3, 3, 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] [2019-09-10 13:01:30,008 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:30,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash -672850143, now seen corresponding path program 1 times [2019-09-10 13:01:30,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:30,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:30,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:30,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:30,012 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:30,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 778 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 751 trivial. 0 not checked. [2019-09-10 13:01:30,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:30,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-10 13:01:30,408 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:30,409 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 13:01:30,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 13:01:30,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 13:01:30,409 INFO L87 Difference]: Start difference. First operand 16330 states and 20159 transitions. Second operand 7 states. [2019-09-10 13:01:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:30,521 INFO L93 Difference]: Finished difference Result 11390 states and 14002 transitions. [2019-09-10 13:01:30,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 13:01:30,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 443 [2019-09-10 13:01:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:30,548 INFO L225 Difference]: With dead ends: 11390 [2019-09-10 13:01:30,548 INFO L226 Difference]: Without dead ends: 11390 [2019-09-10 13:01:30,548 INFO L628 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-09-10 13:01:30,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11390 states. [2019-09-10 13:01:30,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11390 to 11224. [2019-09-10 13:01:30,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11224 states. [2019-09-10 13:01:30,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11224 states to 11224 states and 13740 transitions. [2019-09-10 13:01:30,744 INFO L78 Accepts]: Start accepts. Automaton has 11224 states and 13740 transitions. Word has length 443 [2019-09-10 13:01:30,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:30,745 INFO L475 AbstractCegarLoop]: Abstraction has 11224 states and 13740 transitions. [2019-09-10 13:01:30,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 13:01:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 11224 states and 13740 transitions. [2019-09-10 13:01:30,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2019-09-10 13:01:30,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:30,763 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:30,763 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:30,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:30,764 INFO L82 PathProgramCache]: Analyzing trace with hash 1333951969, now seen corresponding path program 1 times [2019-09-10 13:01:30,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:30,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:30,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:30,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:30,768 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:31,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2019-09-10 13:01:31,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:31,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 13:01:31,647 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:31,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 13:01:31,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 13:01:31,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 13:01:31,649 INFO L87 Difference]: Start difference. First operand 11224 states and 13740 transitions. Second operand 6 states. [2019-09-10 13:01:31,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:31,738 INFO L93 Difference]: Finished difference Result 11296 states and 13836 transitions. [2019-09-10 13:01:31,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 13:01:31,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 635 [2019-09-10 13:01:31,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:31,764 INFO L225 Difference]: With dead ends: 11296 [2019-09-10 13:01:31,765 INFO L226 Difference]: Without dead ends: 11296 [2019-09-10 13:01:31,765 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 13:01:31,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2019-09-10 13:01:31,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 11254. [2019-09-10 13:01:31,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11254 states. [2019-09-10 13:01:31,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11254 states to 11254 states and 13770 transitions. [2019-09-10 13:01:31,935 INFO L78 Accepts]: Start accepts. Automaton has 11254 states and 13770 transitions. Word has length 635 [2019-09-10 13:01:31,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:31,936 INFO L475 AbstractCegarLoop]: Abstraction has 11254 states and 13770 transitions. [2019-09-10 13:01:31,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 13:01:31,936 INFO L276 IsEmpty]: Start isEmpty. Operand 11254 states and 13770 transitions. [2019-09-10 13:01:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-09-10 13:01:31,950 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:31,950 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:31,951 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:31,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:31,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1240271046, now seen corresponding path program 1 times [2019-09-10 13:01:31,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:31,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:31,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:31,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:31,954 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 1007 trivial. 0 not checked. [2019-09-10 13:01:32,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 13:01:32,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 13:01:32,524 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:32,525 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 13:01:32,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 13:01:32,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:01:32,526 INFO L87 Difference]: Start difference. First operand 11254 states and 13770 transitions. Second operand 3 states. [2019-09-10 13:01:32,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:32,680 INFO L93 Difference]: Finished difference Result 11260 states and 13776 transitions. [2019-09-10 13:01:32,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 13:01:32,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 641 [2019-09-10 13:01:32,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:32,706 INFO L225 Difference]: With dead ends: 11260 [2019-09-10 13:01:32,707 INFO L226 Difference]: Without dead ends: 11260 [2019-09-10 13:01:32,707 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 13:01:32,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11260 states. [2019-09-10 13:01:32,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11260 to 11260. [2019-09-10 13:01:32,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11260 states. [2019-09-10 13:01:32,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11260 states to 11260 states and 13776 transitions. [2019-09-10 13:01:32,843 INFO L78 Accepts]: Start accepts. Automaton has 11260 states and 13776 transitions. Word has length 641 [2019-09-10 13:01:32,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:32,844 INFO L475 AbstractCegarLoop]: Abstraction has 11260 states and 13776 transitions. [2019-09-10 13:01:32,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 13:01:32,844 INFO L276 IsEmpty]: Start isEmpty. Operand 11260 states and 13776 transitions. [2019-09-10 13:01:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-09-10 13:01:32,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 13:01:32,858 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 13:01:32,858 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 13:01:32,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:32,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1987608637, now seen corresponding path program 1 times [2019-09-10 13:01:32,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 13:01:32,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:32,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 13:01:32,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 13:01:32,862 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 13:01:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 13:01:33,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1017 backedges. 10 proven. 40 refuted. 0 times theorem prover too weak. 967 trivial. 0 not checked. [2019-09-10 13:01:33,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 13:01:33,568 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 13:01:33,569 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 642 with the following transitions: [2019-09-10 13:01:33,572 INFO L207 CegarAbsIntRunner]: [101], [107], [108], [109], [110], [111], [112], [339], [340], [345], [348], [349], [350], [361], [362], [371], [373], [374], [575], [577], [579], [580], [589], [591], [596], [601], [604], [606], [609], [611], [616], [618], [620], [625], [627], [632], [634], [639], [641], [646], [648], [653], [655], [660], [662], [667], [669], [674], [676], [678], [680], [682], [684], [686], [688], [690], [695], [700], [702], [704], [710], [715], [767], [768], [771], [773], [776], [778], [781], [788], [789], [792], [800], [806], [807], [830], [831], [832], [834], [836], [839], [843], [850], [853], [856], [858], [861], [863], [889], [892], [902], [903], [977], [979], [980], [1149], [1150], [1181], [1182], [1414], [1415], [1501], [1503], [1505], [1506], [1527], [1528], [1529], [1531], [1532], [1535], [1537], [1538], [1639], [1640], [1645], [1647], [1706], [1708], [1709], [1820], [1821], [1822], [1825], [1891], [1948], [1949], [1950], [1951], [1966], [1967], [1978], [1983], [2003], [2005], [2006], [2058], [2060], [2061], [2132], [2133], [2134], [2136], [2169], [2171], [2172], [2291], [2293], [2294], [2310], [2311], [2371], [2373], [2375], [2377], [2379], [2381], [2383], [2385], [2388], [2390], [2392], [2394], [2396], [2398], [2400], [2402], [2404], [2406], [2408], [2420], [2423], [2426], [2438], [2441], [2444], [2446], [2449], [2458], [2477], [2644], [2647], [2650], [2653], [2656], [2658], [2661], [2669], [2672], [2675], [2794], [2796], [2816], [2817], [2818], [2819], [2879], [2881], [2882], [2883], [2888], [2928], [2933], [2935], [2937], [2938], [3047], [3048], [3075], [3077], [3090], [3093], [3094], [3095], [3096], [3097], [3099], [3115], [3118], [3122], [3127], [3128], [3154], [3155], [3166], [3167], [3363], [3364], [3425], [3426], [3427], [3428], [3431], [3432], [3433], [3434], [3435], [3436], [3437], [3438], [3439], [3440], [3441], [3442], [3443], [3444], [3445], [3446], [3447], [3448], [3449], [3450], [3451], [3452], [3453], [3454], [3455], [3456], [3457], [3458], [3459], [3460], [3461], [3462], [3463], [3464], [3465], [3466], [3467], [3468], [3469], [3470], [3471], [3472], [3473], [3474], [3475], [3476], [3477], [3478], [3479], [3480], [3481], [3482], [3483], [3484], [3485], [3486], [3487], [3488], [3489], [3490], [3491], [3492], [3493], [3494], [3495], [3496], [3521], [3522], [3523], [3524], [3525], [3545], [3546], [3547], [3548], [3553], [3554], [3555], [3556], [3557], [3558], [3579], [3609], [3610], [3819], [3820], [3821], [3822], [3835], [3836], [3837], [3838], [3875], [3876], [3909], [3910], [3963], [4039], [4040], [4063], [4064], [4071], [4072], [4113], [4114], [4137], [4138], [4139], [4140], [4141], [4142], [4143], [4144], [4145], [4146], [4147], [4148], [4149], [4150], [4151], [4152], [4153], [4154], [4155], [4156], [4157], [4158], [4159], [4160], [4161], [4162], [4163], [4164], [4165], [4166], [4167], [4168], [4169], [4170], [4171], [4172], [4177], [4178], [4179], [4180], [4209], [4210], [4211], [4237], [4238], [4271], [4272], [4275], [4276], [4333], [4334], [4335], [4336], [4337], [4338], [4385], [4386], [4387] [2019-09-10 13:01:33,635 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 13:01:33,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 13:01:33,856 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 13:01:33,857 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 336 root evaluator evaluations with a maximum evaluation depth of 0. Performed 336 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 654 variables. [2019-09-10 13:01:33,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 13:01:33,862 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 13:01:34,172 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 13:01:34,173 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 13:01:34,189 INFO L420 sIntCurrentIteration]: We unified 640 AI predicates to 640 [2019-09-10 13:01:34,189 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 13:01:34,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 13:01:34,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [11] total 11 [2019-09-10 13:01:34,191 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 13:01:34,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 13:01:34,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 13:01:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 13:01:34,193 INFO L87 Difference]: Start difference. First operand 11260 states and 13776 transitions. Second operand 2 states. [2019-09-10 13:01:34,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 13:01:34,193 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 13:01:34,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 13:01:34,194 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 641 [2019-09-10 13:01:34,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 13:01:34,194 INFO L225 Difference]: With dead ends: 2 [2019-09-10 13:01:34,194 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 13:01:34,195 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 640 GetRequests, 640 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-09-10 13:01:34,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 13:01:34,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 13:01:34,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 13:01:34,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 13:01:34,195 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 641 [2019-09-10 13:01:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 13:01:34,196 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 13:01:34,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 13:01:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 13:01:34,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 13:01:34,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 01:01:34 BoogieIcfgContainer [2019-09-10 13:01:34,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 13:01:34,205 INFO L168 Benchmark]: Toolchain (without parser) took 70327.44 ms. Allocated memory was 131.1 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 78.2 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 213.1 MB. Max. memory is 7.1 GB. [2019-09-10 13:01:34,206 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 131.1 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-09-10 13:01:34,209 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2786.38 ms. Allocated memory was 131.1 MB in the beginning and 270.0 MB in the end (delta: 138.9 MB). Free memory was 78.0 MB in the beginning and 162.6 MB in the end (delta: -84.6 MB). Peak memory consumption was 113.8 MB. Max. memory is 7.1 GB. [2019-09-10 13:01:34,210 INFO L168 Benchmark]: Boogie Preprocessor took 402.45 ms. Allocated memory is still 270.0 MB. Free memory was 162.6 MB in the beginning and 135.9 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2019-09-10 13:01:34,213 INFO L168 Benchmark]: RCFGBuilder took 8462.26 ms. Allocated memory was 270.0 MB in the beginning and 490.2 MB in the end (delta: 220.2 MB). Free memory was 135.9 MB in the beginning and 390.7 MB in the end (delta: -254.7 MB). Peak memory consumption was 324.1 MB. Max. memory is 7.1 GB. [2019-09-10 13:01:34,214 INFO L168 Benchmark]: TraceAbstraction took 58671.55 ms. Allocated memory was 490.2 MB in the beginning and 2.4 GB in the end (delta: 1.9 GB). Free memory was 390.7 MB in the beginning and 2.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 166.3 MB. Max. memory is 7.1 GB. [2019-09-10 13:01:34,221 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.22 ms. Allocated memory is still 131.1 MB. Free memory was 105.6 MB in the beginning and 105.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2786.38 ms. Allocated memory was 131.1 MB in the beginning and 270.0 MB in the end (delta: 138.9 MB). Free memory was 78.0 MB in the beginning and 162.6 MB in the end (delta: -84.6 MB). Peak memory consumption was 113.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 402.45 ms. Allocated memory is still 270.0 MB. Free memory was 162.6 MB in the beginning and 135.9 MB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 8462.26 ms. Allocated memory was 270.0 MB in the beginning and 490.2 MB in the end (delta: 220.2 MB). Free memory was 135.9 MB in the beginning and 390.7 MB in the end (delta: -254.7 MB). Peak memory consumption was 324.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 58671.55 ms. Allocated memory was 490.2 MB in the beginning and 2.4 GB in the end (delta: 1.9 GB). Free memory was 390.7 MB in the beginning and 2.2 GB in the end (delta: -1.8 GB). Peak memory consumption was 166.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 6454]: 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 255 procedures, 2048 locations, 1 error locations. SAFE Result, 58.5s OverallTime, 28 OverallIterations, 10 TraceHistogramMax, 32.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 58995 SDtfs, 25124 SDslu, 132646 SDs, 0 SdLazy, 899 SolverSat, 179 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 26.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 800 GetRequests, 705 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32331occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.8171875 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 31930 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 9865 NumberOfCodeBlocks, 9865 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 9837 ConstructedInterpolants, 0 QuantifiedInterpolants, 4251097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 27 PerfectInterpolantSequences, 19704/19744 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...