java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 17:10:45,285 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 17:10:45,287 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 17:10:45,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 17:10:45,302 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 17:10:45,303 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 17:10:45,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 17:10:45,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 17:10:45,312 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 17:10:45,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 17:10:45,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 17:10:45,316 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 17:10:45,316 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 17:10:45,319 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 17:10:45,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 17:10:45,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 17:10:45,325 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 17:10:45,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 17:10:45,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 17:10:45,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 17:10:45,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 17:10:45,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 17:10:45,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 17:10:45,334 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 17:10:45,337 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 17:10:45,337 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 17:10:45,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 17:10:45,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 17:10:45,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 17:10:45,343 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 17:10:45,343 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 17:10:45,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 17:10:45,345 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 17:10:45,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 17:10:45,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 17:10:45,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 17:10:45,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 17:10:45,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 17:10:45,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 17:10:45,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 17:10:45,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 17:10:45,351 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-16 17:10:45,372 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 17:10:45,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 17:10:45,373 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-16 17:10:45,373 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-16 17:10:45,374 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-16 17:10:45,375 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-16 17:10:45,375 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-16 17:10:45,376 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-16 17:10:45,376 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-16 17:10:45,376 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-16 17:10:45,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 17:10:45,378 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 17:10:45,378 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 17:10:45,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 17:10:45,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 17:10:45,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 17:10:45,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 17:10:45,380 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 17:10:45,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 17:10:45,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 17:10:45,381 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 17:10:45,381 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-16 17:10:45,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 17:10:45,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 17:10:45,382 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 17:10:45,382 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 17:10:45,382 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-16 17:10:45,382 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 17:10:45,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 17:10:45,383 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-16 17:10:45,428 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 17:10:45,440 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 17:10:45,444 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 17:10:45,445 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 17:10:45,446 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 17:10:45,446 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-09-16 17:10:45,518 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae29ebea/3d7386b230b2465c86fdc87474482fb6/FLAG4c997b7d0 [2019-09-16 17:10:46,232 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 17:10:46,233 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-09-16 17:10:46,262 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae29ebea/3d7386b230b2465c86fdc87474482fb6/FLAG4c997b7d0 [2019-09-16 17:10:46,293 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bae29ebea/3d7386b230b2465c86fdc87474482fb6 [2019-09-16 17:10:46,303 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 17:10:46,304 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 17:10:46,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 17:10:46,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 17:10:46,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 17:10:46,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:10:46" (1/1) ... [2019-09-16 17:10:46,313 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a8bcef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:46, skipping insertion in model container [2019-09-16 17:10:46,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 05:10:46" (1/1) ... [2019-09-16 17:10:46,321 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 17:10:46,440 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 17:10:47,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:10:47,584 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 17:10:47,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 17:10:47,882 INFO L192 MainTranslator]: Completed translation [2019-09-16 17:10:47,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:47 WrapperNode [2019-09-16 17:10:47,883 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 17:10:47,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 17:10:47,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 17:10:47,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 17:10:47,898 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:47" (1/1) ... [2019-09-16 17:10:47,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:47" (1/1) ... [2019-09-16 17:10:47,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:47" (1/1) ... [2019-09-16 17:10:47,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:47" (1/1) ... [2019-09-16 17:10:48,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:47" (1/1) ... [2019-09-16 17:10:48,088 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:47" (1/1) ... [2019-09-16 17:10:48,112 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:47" (1/1) ... [2019-09-16 17:10:48,134 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 17:10:48,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 17:10:48,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 17:10:48,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 17:10:48,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:47" (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-16 17:10:48,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 17:10:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 17:10:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-09-16 17:10:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-09-16 17:10:48,217 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-16 17:10:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-16 17:10:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_insert_flip_string [2019-09-16 17:10:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-09-16 17:10:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2019-09-16 17:10:48,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-16 17:10:48,219 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_uint_must_check_helper [2019-09-16 17:10:48,219 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_usb_dump_class_desc [2019-09-16 17:10:48,219 INFO L138 BoogieDeclarations]: Found implementation of procedure irda_usb_find_class_desc [2019-09-16 17:10:48,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_xbof_change [2019-09-16 17:10:48,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_startup [2019-09-16 17:10:48,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_open [2019-09-16 17:10:48,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_prepare_write_buffer [2019-09-16 17:10:48,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_process_read_urb [2019-09-16 17:10:48,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_set_termios_callback [2019-09-16 17:10:48,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_set_termios [2019-09-16 17:10:48,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_init [2019-09-16 17:10:48,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ir_exit [2019-09-16 17:10:48,221 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2019-09-16 17:10:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2019-09-16 17:10:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 17:10:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-09-16 17:10:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-09-16 17:10:48,222 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-09-16 17:10:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-09-16 17:10:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-09-16 17:10:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-09-16 17:10:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-16 17:10:48,223 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_out [2019-09-16 17:10:48,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __kfifo_out_r [2019-09-16 17:10:48,224 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-16 17:10:48,224 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-09-16 17:10:48,224 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-09-16 17:10:48,224 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2019-09-16 17:10:48,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-09-16 17:10:48,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-16 17:10:48,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-09-16 17:10:48,225 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-16 17:10:48,225 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_encode_baud_rate [2019-09-16 17:10:48,225 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_flip_buffer_push [2019-09-16 17:10:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_get_baud_rate [2019-09-16 17:10:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_insert_flip_string_fixed_flag [2019-09-16 17:10:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_kref_put [2019-09-16 17:10:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_port_tty_get [2019-09-16 17:10:48,226 INFO L138 BoogieDeclarations]: Found implementation of procedure tty_termios_copy_hw [2019-09-16 17:10:48,227 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2019-09-16 17:10:48,227 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-16 17:10:48,227 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-16 17:10:48,227 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_deregister [2019-09-16 17:10:48,227 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_generic_open [2019-09-16 17:10:48,227 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_serial_register [2019-09-16 17:10:48,228 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-09-16 17:10:48,228 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-16 17:10:48,228 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-16 17:10:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 17:10:48,228 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-16 17:10:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-09-16 17:10:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-09-16 17:10:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-09-16 17:10:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-09-16 17:10:48,229 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-16 17:10:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-16 17:10:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-16 17:10:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-16 17:10:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2019-09-16 17:10:48,230 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2019-09-16 17:10:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2019-09-16 17:10:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure tty_kref_put [2019-09-16 17:10:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure tty_flip_buffer_push [2019-09-16 17:10:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure tty_get_baud_rate [2019-09-16 17:10:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure tty_encode_baud_rate [2019-09-16 17:10:48,231 INFO L130 BoogieDeclarations]: Found specification of procedure tty_termios_copy_hw [2019-09-16 17:10:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure tty_port_tty_get [2019-09-16 17:10:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure tty_insert_flip_string_fixed_flag [2019-09-16 17:10:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure tty_insert_flip_string [2019-09-16 17:10:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-16 17:10:48,232 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-09-16 17:10:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 17:10:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-16 17:10:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2019-09-16 17:10:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 17:10:48,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 17:10:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-09-16 17:10:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-09-16 17:10:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-09-16 17:10:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-09-16 17:10:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-09-16 17:10:48,234 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2019-09-16 17:10:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-16 17:10:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 17:10:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_uint_must_check_helper [2019-09-16 17:10:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_out [2019-09-16 17:10:48,235 INFO L130 BoogieDeclarations]: Found specification of procedure __kfifo_out_r [2019-09-16 17:10:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_register [2019-09-16 17:10:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_deregister [2019-09-16 17:10:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_probe [2019-09-16 17:10:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_disconnect [2019-09-16 17:10:48,236 INFO L130 BoogieDeclarations]: Found specification of procedure usb_serial_generic_open [2019-09-16 17:10:48,237 INFO L130 BoogieDeclarations]: Found specification of procedure ir_startup [2019-09-16 17:10:48,237 INFO L130 BoogieDeclarations]: Found specification of procedure ir_open [2019-09-16 17:10:48,237 INFO L130 BoogieDeclarations]: Found specification of procedure ir_prepare_write_buffer [2019-09-16 17:10:48,237 INFO L130 BoogieDeclarations]: Found specification of procedure ir_process_read_urb [2019-09-16 17:10:48,237 INFO L130 BoogieDeclarations]: Found specification of procedure ir_set_termios [2019-09-16 17:10:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure irda_usb_dump_class_desc [2019-09-16 17:10:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure irda_usb_find_class_desc [2019-09-16 17:10:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure ir_xbof_change [2019-09-16 17:10:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 17:10:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure ir_set_termios_callback [2019-09-16 17:10:48,238 INFO L130 BoogieDeclarations]: Found specification of procedure ir_init [2019-09-16 17:10:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure ir_exit [2019-09-16 17:10:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-16 17:10:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-09-16 17:10:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-16 17:10:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-16 17:10:48,239 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 17:10:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-09-16 17:10:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-09-16 17:10:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-09-16 17:10:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-16 17:10:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-16 17:10:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-16 17:10:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-16 17:10:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-16 17:10:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 17:10:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 17:10:48,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-16 17:10:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 17:10:48,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 17:10:48,990 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:10:49,135 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##28: assume !false; [2019-09-16 17:10:49,135 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##27: assume false; [2019-09-16 17:10:49,171 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:10:49,235 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##25: assume !false; [2019-09-16 17:10:49,235 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##24: assume false; [2019-09-16 17:10:49,657 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-09-16 17:10:49,664 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:10:49,690 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##20: assume !false; [2019-09-16 17:10:49,690 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume false; [2019-09-16 17:10:51,878 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-16 17:10:51,955 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume false; [2019-09-16 17:10:51,955 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume !false; [2019-09-16 17:10:51,980 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 17:10:51,981 INFO L283 CfgBuilder]: Removed 27 assume(true) statements. [2019-09-16 17:10:51,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:10:51 BoogieIcfgContainer [2019-09-16 17:10:51,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 17:10:51,983 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 17:10:51,984 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 17:10:51,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 17:10:51,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 05:10:46" (1/3) ... [2019-09-16 17:10:51,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726631f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:10:51, skipping insertion in model container [2019-09-16 17:10:51,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 05:10:47" (2/3) ... [2019-09-16 17:10:51,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726631f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 05:10:51, skipping insertion in model container [2019-09-16 17:10:51,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 05:10:51" (3/3) ... [2019-09-16 17:10:51,990 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-usb-serial-ir-usb.ko.cil.out.i [2019-09-16 17:10:52,000 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 17:10:52,012 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 17:10:52,029 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 17:10:52,051 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 17:10:52,051 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-16 17:10:52,051 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 17:10:52,051 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 17:10:52,051 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 17:10:52,051 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 17:10:52,052 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 17:10:52,052 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 17:10:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states. [2019-09-16 17:10:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:10:52,086 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:10:52,087 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:10:52,090 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:10:52,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:10:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash 921078484, now seen corresponding path program 1 times [2019-09-16 17:10:52,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:10:52,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:52,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:10:52,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:10:52,176 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:10:52,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:10:52,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:10:52,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:10:52,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:10:52,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:10:52,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:10:52,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:10:52,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:10:52,870 INFO L87 Difference]: Start difference. First operand 441 states. Second operand 6 states. [2019-09-16 17:11:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:01,031 INFO L93 Difference]: Finished difference Result 755 states and 935 transitions. [2019-09-16 17:11:01,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:11:01,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-09-16 17:11:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:01,070 INFO L225 Difference]: With dead ends: 755 [2019-09-16 17:11:01,070 INFO L226 Difference]: Without dead ends: 737 [2019-09-16 17:11:01,072 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:11:01,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-16 17:11:01,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 725. [2019-09-16 17:11:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2019-09-16 17:11:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 902 transitions. [2019-09-16 17:11:01,190 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 902 transitions. Word has length 27 [2019-09-16 17:11:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:01,190 INFO L475 AbstractCegarLoop]: Abstraction has 725 states and 902 transitions. [2019-09-16 17:11:01,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:11:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 902 transitions. [2019-09-16 17:11:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 17:11:01,191 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:01,191 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:01,192 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:01,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:01,192 INFO L82 PathProgramCache]: Analyzing trace with hash -99989870, now seen corresponding path program 1 times [2019-09-16 17:11:01,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:01,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:01,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:01,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:01,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:11:01,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:01,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:11:01,445 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:01,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:11:01,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:11:01,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:11:01,447 INFO L87 Difference]: Start difference. First operand 725 states and 902 transitions. Second operand 3 states. [2019-09-16 17:11:01,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:01,502 INFO L93 Difference]: Finished difference Result 1410 states and 1763 transitions. [2019-09-16 17:11:01,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:11:01,502 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-09-16 17:11:01,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:01,515 INFO L225 Difference]: With dead ends: 1410 [2019-09-16 17:11:01,515 INFO L226 Difference]: Without dead ends: 1410 [2019-09-16 17:11:01,516 INFO L636 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-16 17:11:01,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2019-09-16 17:11:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1395. [2019-09-16 17:11:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1395 states. [2019-09-16 17:11:01,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1749 transitions. [2019-09-16 17:11:01,598 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1749 transitions. Word has length 27 [2019-09-16 17:11:01,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:01,601 INFO L475 AbstractCegarLoop]: Abstraction has 1395 states and 1749 transitions. [2019-09-16 17:11:01,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:11:01,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1749 transitions. [2019-09-16 17:11:01,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-16 17:11:01,602 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:01,603 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:01,603 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:01,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:01,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1195105585, now seen corresponding path program 1 times [2019-09-16 17:11:01,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:01,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:01,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:01,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:01,618 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:01,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:11:01,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:01,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:11:01,849 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:01,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:11:01,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:11:01,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:11:01,851 INFO L87 Difference]: Start difference. First operand 1395 states and 1749 transitions. Second operand 3 states. [2019-09-16 17:11:01,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:01,878 INFO L93 Difference]: Finished difference Result 1394 states and 1747 transitions. [2019-09-16 17:11:01,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:11:01,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-09-16 17:11:01,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:01,892 INFO L225 Difference]: With dead ends: 1394 [2019-09-16 17:11:01,892 INFO L226 Difference]: Without dead ends: 1372 [2019-09-16 17:11:01,897 INFO L636 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-16 17:11:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2019-09-16 17:11:01,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1372. [2019-09-16 17:11:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-09-16 17:11:01,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1719 transitions. [2019-09-16 17:11:01,955 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1719 transitions. Word has length 28 [2019-09-16 17:11:01,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:01,958 INFO L475 AbstractCegarLoop]: Abstraction has 1372 states and 1719 transitions. [2019-09-16 17:11:01,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:11:01,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1719 transitions. [2019-09-16 17:11:01,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-16 17:11:01,980 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:01,980 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:01,980 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:01,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:01,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1665270100, now seen corresponding path program 1 times [2019-09-16 17:11:01,982 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:01,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:01,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:01,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:01,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 17:11:02,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:02,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:11:02,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:02,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:11:02,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:11:02,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:11:02,285 INFO L87 Difference]: Start difference. First operand 1372 states and 1719 transitions. Second operand 6 states. [2019-09-16 17:11:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:02,332 INFO L93 Difference]: Finished difference Result 1376 states and 1722 transitions. [2019-09-16 17:11:02,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:11:02,333 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-09-16 17:11:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:02,340 INFO L225 Difference]: With dead ends: 1376 [2019-09-16 17:11:02,340 INFO L226 Difference]: Without dead ends: 1367 [2019-09-16 17:11:02,341 INFO L636 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-16 17:11:02,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-09-16 17:11:02,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1367. [2019-09-16 17:11:02,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-09-16 17:11:02,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1712 transitions. [2019-09-16 17:11:02,381 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1712 transitions. Word has length 102 [2019-09-16 17:11:02,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:02,381 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 1712 transitions. [2019-09-16 17:11:02,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:11:02,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1712 transitions. [2019-09-16 17:11:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-16 17:11:02,385 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:02,385 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:02,386 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:02,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:02,386 INFO L82 PathProgramCache]: Analyzing trace with hash 960569056, now seen corresponding path program 1 times [2019-09-16 17:11:02,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:02,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:02,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:02,391 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 17:11:02,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:02,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:11:02,583 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:02,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:11:02,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:11:02,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:11:02,584 INFO L87 Difference]: Start difference. First operand 1367 states and 1712 transitions. Second operand 5 states. [2019-09-16 17:11:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:08,284 INFO L93 Difference]: Finished difference Result 1393 states and 1737 transitions. [2019-09-16 17:11:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:11:08,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-16 17:11:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:08,292 INFO L225 Difference]: With dead ends: 1393 [2019-09-16 17:11:08,293 INFO L226 Difference]: Without dead ends: 1393 [2019-09-16 17:11:08,293 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:11:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2019-09-16 17:11:08,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1367. [2019-09-16 17:11:08,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-09-16 17:11:08,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 1710 transitions. [2019-09-16 17:11:08,335 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 1710 transitions. Word has length 112 [2019-09-16 17:11:08,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:08,336 INFO L475 AbstractCegarLoop]: Abstraction has 1367 states and 1710 transitions. [2019-09-16 17:11:08,336 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:11:08,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 1710 transitions. [2019-09-16 17:11:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-16 17:11:08,339 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:08,339 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:08,339 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:08,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:08,340 INFO L82 PathProgramCache]: Analyzing trace with hash 467942882, now seen corresponding path program 1 times [2019-09-16 17:11:08,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:08,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:08,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:08,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:08,345 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 17:11:08,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:08,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:11:08,570 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:08,571 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:11:08,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:11:08,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:11:08,572 INFO L87 Difference]: Start difference. First operand 1367 states and 1710 transitions. Second operand 5 states. [2019-09-16 17:11:08,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:08,602 INFO L93 Difference]: Finished difference Result 1340 states and 1671 transitions. [2019-09-16 17:11:08,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:11:08,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-16 17:11:08,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:08,610 INFO L225 Difference]: With dead ends: 1340 [2019-09-16 17:11:08,610 INFO L226 Difference]: Without dead ends: 1340 [2019-09-16 17:11:08,611 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:11:08,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-09-16 17:11:08,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1336. [2019-09-16 17:11:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-09-16 17:11:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1665 transitions. [2019-09-16 17:11:08,649 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1665 transitions. Word has length 112 [2019-09-16 17:11:08,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:08,650 INFO L475 AbstractCegarLoop]: Abstraction has 1336 states and 1665 transitions. [2019-09-16 17:11:08,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:11:08,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1665 transitions. [2019-09-16 17:11:08,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-16 17:11:08,653 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:08,653 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:08,654 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:08,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:08,654 INFO L82 PathProgramCache]: Analyzing trace with hash -26259892, now seen corresponding path program 1 times [2019-09-16 17:11:08,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:08,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:08,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:08,659 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:08,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 17:11:08,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:08,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:11:08,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:08,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:11:08,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:11:08,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:11:08,886 INFO L87 Difference]: Start difference. First operand 1336 states and 1665 transitions. Second operand 5 states. [2019-09-16 17:11:08,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:08,914 INFO L93 Difference]: Finished difference Result 1340 states and 1667 transitions. [2019-09-16 17:11:08,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 17:11:08,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-16 17:11:08,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:08,921 INFO L225 Difference]: With dead ends: 1340 [2019-09-16 17:11:08,922 INFO L226 Difference]: Without dead ends: 1340 [2019-09-16 17:11:08,922 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:11:08,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2019-09-16 17:11:08,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1340. [2019-09-16 17:11:08,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1340 states. [2019-09-16 17:11:08,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1340 states to 1340 states and 1667 transitions. [2019-09-16 17:11:08,960 INFO L78 Accepts]: Start accepts. Automaton has 1340 states and 1667 transitions. Word has length 109 [2019-09-16 17:11:08,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:08,960 INFO L475 AbstractCegarLoop]: Abstraction has 1340 states and 1667 transitions. [2019-09-16 17:11:08,961 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:11:08,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1340 states and 1667 transitions. [2019-09-16 17:11:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-16 17:11:08,963 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:08,964 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:08,964 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:08,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:08,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1161044579, now seen corresponding path program 1 times [2019-09-16 17:11:08,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:08,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:08,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:08,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:08,969 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:09,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:09,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 17:11:09,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:09,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 17:11:09,164 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:09,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 17:11:09,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 17:11:09,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 17:11:09,166 INFO L87 Difference]: Start difference. First operand 1340 states and 1667 transitions. Second operand 5 states. [2019-09-16 17:11:12,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:12,947 INFO L93 Difference]: Finished difference Result 1361 states and 1685 transitions. [2019-09-16 17:11:12,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 17:11:12,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-16 17:11:12,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:12,954 INFO L225 Difference]: With dead ends: 1361 [2019-09-16 17:11:12,955 INFO L226 Difference]: Without dead ends: 1361 [2019-09-16 17:11:12,955 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-16 17:11:12,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-09-16 17:11:12,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1336. [2019-09-16 17:11:12,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-09-16 17:11:12,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1659 transitions. [2019-09-16 17:11:12,997 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1659 transitions. Word has length 112 [2019-09-16 17:11:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:12,997 INFO L475 AbstractCegarLoop]: Abstraction has 1336 states and 1659 transitions. [2019-09-16 17:11:12,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 17:11:12,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1659 transitions. [2019-09-16 17:11:13,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-16 17:11:13,001 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:13,001 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:13,001 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:13,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:13,002 INFO L82 PathProgramCache]: Analyzing trace with hash 971083495, now seen corresponding path program 1 times [2019-09-16 17:11:13,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:13,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:13,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:13,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:13,009 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:13,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 17:11:13,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:13,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:11:13,444 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:13,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:11:13,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:11:13,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:11:13,446 INFO L87 Difference]: Start difference. First operand 1336 states and 1659 transitions. Second operand 6 states. [2019-09-16 17:11:16,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:16,846 INFO L93 Difference]: Finished difference Result 2026 states and 2527 transitions. [2019-09-16 17:11:16,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:11:16,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2019-09-16 17:11:16,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:16,857 INFO L225 Difference]: With dead ends: 2026 [2019-09-16 17:11:16,857 INFO L226 Difference]: Without dead ends: 2026 [2019-09-16 17:11:16,858 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:11:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-09-16 17:11:16,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2008. [2019-09-16 17:11:16,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2019-09-16 17:11:16,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 2511 transitions. [2019-09-16 17:11:16,910 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 2511 transitions. Word has length 112 [2019-09-16 17:11:16,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:16,910 INFO L475 AbstractCegarLoop]: Abstraction has 2008 states and 2511 transitions. [2019-09-16 17:11:16,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:11:16,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 2511 transitions. [2019-09-16 17:11:16,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-16 17:11:16,914 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:16,915 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:11:16,915 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:16,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:16,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1928323846, now seen corresponding path program 1 times [2019-09-16 17:11:16,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:16,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:16,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:16,920 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:17,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 17:11:17,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:17,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:11:17,229 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:17,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:11:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:11:17,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:11:17,230 INFO L87 Difference]: Start difference. First operand 2008 states and 2511 transitions. Second operand 6 states. [2019-09-16 17:11:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:19,183 INFO L93 Difference]: Finished difference Result 4043 states and 5085 transitions. [2019-09-16 17:11:19,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 17:11:19,184 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 132 [2019-09-16 17:11:19,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:19,203 INFO L225 Difference]: With dead ends: 4043 [2019-09-16 17:11:19,204 INFO L226 Difference]: Without dead ends: 4013 [2019-09-16 17:11:19,204 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-09-16 17:11:19,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4013 states. [2019-09-16 17:11:19,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4013 to 3948. [2019-09-16 17:11:19,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-09-16 17:11:19,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 4967 transitions. [2019-09-16 17:11:19,318 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 4967 transitions. Word has length 132 [2019-09-16 17:11:19,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:19,318 INFO L475 AbstractCegarLoop]: Abstraction has 3948 states and 4967 transitions. [2019-09-16 17:11:19,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:11:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 4967 transitions. [2019-09-16 17:11:19,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-16 17:11:19,325 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:19,325 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:11:19,325 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:19,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1480929588, now seen corresponding path program 1 times [2019-09-16 17:11:19,326 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:19,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:19,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:19,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:19,332 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 17:11:19,550 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:19,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-16 17:11:19,550 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:19,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-16 17:11:19,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-16 17:11:19,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-16 17:11:19,552 INFO L87 Difference]: Start difference. First operand 3948 states and 4967 transitions. Second operand 3 states. [2019-09-16 17:11:19,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:19,566 INFO L93 Difference]: Finished difference Result 2758 states and 3419 transitions. [2019-09-16 17:11:19,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-16 17:11:19,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-16 17:11:19,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:19,579 INFO L225 Difference]: With dead ends: 2758 [2019-09-16 17:11:19,579 INFO L226 Difference]: Without dead ends: 2758 [2019-09-16 17:11:19,581 INFO L636 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-16 17:11:19,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2758 states. [2019-09-16 17:11:19,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2758 to 2758. [2019-09-16 17:11:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2758 states. [2019-09-16 17:11:19,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2758 states to 2758 states and 3419 transitions. [2019-09-16 17:11:19,654 INFO L78 Accepts]: Start accepts. Automaton has 2758 states and 3419 transitions. Word has length 140 [2019-09-16 17:11:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:19,654 INFO L475 AbstractCegarLoop]: Abstraction has 2758 states and 3419 transitions. [2019-09-16 17:11:19,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-16 17:11:19,655 INFO L276 IsEmpty]: Start isEmpty. Operand 2758 states and 3419 transitions. [2019-09-16 17:11:19,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-16 17:11:19,659 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:19,659 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 17:11:19,659 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:19,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:19,660 INFO L82 PathProgramCache]: Analyzing trace with hash -16580239, now seen corresponding path program 1 times [2019-09-16 17:11:19,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:19,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:19,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:19,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:19,664 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:19,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:20,069 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-16 17:11:20,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:20,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-16 17:11:20,070 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:20,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-16 17:11:20,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-16 17:11:20,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-16 17:11:20,071 INFO L87 Difference]: Start difference. First operand 2758 states and 3419 transitions. Second operand 8 states. [2019-09-16 17:11:25,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:25,511 INFO L93 Difference]: Finished difference Result 2821 states and 3473 transitions. [2019-09-16 17:11:25,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 17:11:25,512 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 142 [2019-09-16 17:11:25,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:25,525 INFO L225 Difference]: With dead ends: 2821 [2019-09-16 17:11:25,525 INFO L226 Difference]: Without dead ends: 2808 [2019-09-16 17:11:25,525 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-09-16 17:11:25,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2019-09-16 17:11:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2808. [2019-09-16 17:11:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2808 states. [2019-09-16 17:11:25,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2808 states to 2808 states and 3453 transitions. [2019-09-16 17:11:25,606 INFO L78 Accepts]: Start accepts. Automaton has 2808 states and 3453 transitions. Word has length 142 [2019-09-16 17:11:25,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:25,607 INFO L475 AbstractCegarLoop]: Abstraction has 2808 states and 3453 transitions. [2019-09-16 17:11:25,607 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-16 17:11:25,608 INFO L276 IsEmpty]: Start isEmpty. Operand 2808 states and 3453 transitions. [2019-09-16 17:11:25,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-16 17:11:25,619 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 17:11:25,619 INFO L407 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 17:11:25,620 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 17:11:25,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 17:11:25,620 INFO L82 PathProgramCache]: Analyzing trace with hash 36359211, now seen corresponding path program 1 times [2019-09-16 17:11:25,620 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-16 17:11:25,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:25,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 17:11:25,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 17:11:25,627 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-16 17:11:25,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 17:11:25,915 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-09-16 17:11:25,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 17:11:25,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-16 17:11:25,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-16 17:11:25,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 17:11:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 17:11:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 17:11:25,917 INFO L87 Difference]: Start difference. First operand 2808 states and 3453 transitions. Second operand 6 states. [2019-09-16 17:11:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 17:11:34,496 INFO L93 Difference]: Finished difference Result 2805 states and 3447 transitions. [2019-09-16 17:11:34,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 17:11:34,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 210 [2019-09-16 17:11:34,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 17:11:34,502 INFO L225 Difference]: With dead ends: 2805 [2019-09-16 17:11:34,502 INFO L226 Difference]: Without dead ends: 0 [2019-09-16 17:11:34,503 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-16 17:11:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-16 17:11:34,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-16 17:11:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-16 17:11:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-16 17:11:34,504 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 210 [2019-09-16 17:11:34,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 17:11:34,504 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-16 17:11:34,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 17:11:34,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-16 17:11:34,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-16 17:11:34,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.09 05:11:34 BoogieIcfgContainer [2019-09-16 17:11:34,513 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-16 17:11:34,516 INFO L168 Benchmark]: Toolchain (without parser) took 48211.05 ms. Allocated memory was 139.5 MB in the beginning and 614.5 MB in the end (delta: 475.0 MB). Free memory was 80.7 MB in the beginning and 477.0 MB in the end (delta: -396.3 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. [2019-09-16 17:11:34,516 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 139.5 MB. Free memory is still 105.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-09-16 17:11:34,519 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1578.14 ms. Allocated memory was 139.5 MB in the beginning and 219.2 MB in the end (delta: 79.7 MB). Free memory was 80.2 MB in the beginning and 116.9 MB in the end (delta: -36.6 MB). Peak memory consumption was 57.0 MB. Max. memory is 7.1 GB. [2019-09-16 17:11:34,520 INFO L168 Benchmark]: Boogie Preprocessor took 251.63 ms. Allocated memory is still 219.2 MB. Free memory was 116.9 MB in the beginning and 105.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:11:34,527 INFO L168 Benchmark]: RCFGBuilder took 3846.94 ms. Allocated memory was 219.2 MB in the beginning and 357.0 MB in the end (delta: 137.9 MB). Free memory was 105.5 MB in the beginning and 185.3 MB in the end (delta: -79.8 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. [2019-09-16 17:11:34,527 INFO L168 Benchmark]: TraceAbstraction took 42529.99 ms. Allocated memory was 357.0 MB in the beginning and 614.5 MB in the end (delta: 257.4 MB). Free memory was 185.3 MB in the beginning and 477.0 MB in the end (delta: -291.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-09-16 17:11:34,534 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.20 ms. Allocated memory is still 139.5 MB. Free memory is still 105.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1578.14 ms. Allocated memory was 139.5 MB in the beginning and 219.2 MB in the end (delta: 79.7 MB). Free memory was 80.2 MB in the beginning and 116.9 MB in the end (delta: -36.6 MB). Peak memory consumption was 57.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 251.63 ms. Allocated memory is still 219.2 MB. Free memory was 116.9 MB in the beginning and 105.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3846.94 ms. Allocated memory was 219.2 MB in the beginning and 357.0 MB in the end (delta: 137.9 MB). Free memory was 105.5 MB in the beginning and 185.3 MB in the end (delta: -79.8 MB). Peak memory consumption was 88.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42529.99 ms. Allocated memory was 357.0 MB in the beginning and 614.5 MB in the end (delta: 257.4 MB). Free memory was 185.3 MB in the beginning and 477.0 MB in the end (delta: -291.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4900]: 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 58 procedures, 468 locations, 1 error locations. SAFE Result, 42.4s OverallTime, 13 OverallIterations, 4 TraceHistogramMax, 37.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7328 SDtfs, 8035 SDslu, 10282 SDs, 0 SdLazy, 7114 SolverSat, 1425 SolverUnsat, 9 SolverUnknown, 0 SolverNotchecked, 33.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3948occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 165 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1365 NumberOfCodeBlocks, 1365 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1352 ConstructedInterpolants, 0 QuantifiedInterpolants, 310885 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 133/133 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...