java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 02:10:08,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 02:10:08,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 02:10:08,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 02:10:08,257 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 02:10:08,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 02:10:08,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 02:10:08,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 02:10:08,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 02:10:08,281 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 02:10:08,283 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 02:10:08,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 02:10:08,284 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 02:10:08,286 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 02:10:08,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 02:10:08,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 02:10:08,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 02:10:08,292 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 02:10:08,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 02:10:08,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 02:10:08,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 02:10:08,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 02:10:08,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 02:10:08,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 02:10:08,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 02:10:08,313 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 02:10:08,313 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 02:10:08,315 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 02:10:08,316 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 02:10:08,317 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 02:10:08,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 02:10:08,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 02:10:08,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 02:10:08,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 02:10:08,323 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 02:10:08,323 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 02:10:08,324 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 02:10:08,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 02:10:08,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 02:10:08,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 02:10:08,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 02:10:08,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 02:10:08,346 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 02:10:08,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 02:10:08,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 02:10:08,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 02:10:08,350 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 02:10:08,350 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 02:10:08,350 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 02:10:08,350 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 02:10:08,350 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 02:10:08,351 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 02:10:08,352 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 02:10:08,352 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 02:10:08,352 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 02:10:08,353 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 02:10:08,353 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 02:10:08,353 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 02:10:08,353 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 02:10:08,354 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 02:10:08,354 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 02:10:08,354 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 02:10:08,354 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 02:10:08,354 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 02:10:08,355 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 02:10:08,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 02:10:08,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 02:10:08,355 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 02:10:08,355 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 02:10:08,355 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 02:10:08,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 02:10:08,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 02:10:08,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 02:10:08,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 02:10:08,685 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 02:10:08,685 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 02:10:08,686 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-input-tablet-kbtab.ko.cil.out.i [2019-10-15 02:10:08,751 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d99e4740/6486e01b5b484fe1b404d73f54dd76e1/FLAG68225eb60 [2019-10-15 02:10:09,451 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 02:10:09,452 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-15 02:10:09,490 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d99e4740/6486e01b5b484fe1b404d73f54dd76e1/FLAG68225eb60 [2019-10-15 02:10:09,567 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d99e4740/6486e01b5b484fe1b404d73f54dd76e1 [2019-10-15 02:10:09,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 02:10:09,578 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 02:10:09,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 02:10:09,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 02:10:09,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 02:10:09,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:10:09" (1/1) ... [2019-10-15 02:10:09,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c66585 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:09, skipping insertion in model container [2019-10-15 02:10:09,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:10:09" (1/1) ... [2019-10-15 02:10:09,594 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 02:10:09,683 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 02:10:10,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:10:10,809 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 02:10:11,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:10:11,148 INFO L192 MainTranslator]: Completed translation [2019-10-15 02:10:11,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:11 WrapperNode [2019-10-15 02:10:11,150 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 02:10:11,151 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 02:10:11,151 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 02:10:11,151 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 02:10:11,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:11" (1/1) ... [2019-10-15 02:10:11,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:11" (1/1) ... [2019-10-15 02:10:11,198 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:11" (1/1) ... [2019-10-15 02:10:11,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:11" (1/1) ... [2019-10-15 02:10:11,259 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:11" (1/1) ... [2019-10-15 02:10:11,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:11" (1/1) ... [2019-10-15 02:10:11,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:11" (1/1) ... [2019-10-15 02:10:11,287 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 02:10:11,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 02:10:11,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 02:10:11,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 02:10:11,289 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 02:10:11,353 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 02:10:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 02:10:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure __le16_to_cpup [2019-10-15 02:10:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-15 02:10:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-15 02:10:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2019-10-15 02:10:11,354 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-10-15 02:10:11,355 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-15 02:10:11,355 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-15 02:10:11,355 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-15 02:10:11,355 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2019-10-15 02:10:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-15 02:10:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-15 02:10:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-10-15 02:10:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-10-15 02:10:11,356 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-15 02:10:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-10-15 02:10:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-15 02:10:11,357 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-10-15 02:10:11,358 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2019-10-15 02:10:11,358 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_irq [2019-10-15 02:10:11,358 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_open [2019-10-15 02:10:11,359 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_close [2019-10-15 02:10:11,359 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2019-10-15 02:10:11,359 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2019-10-15 02:10:11,359 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2019-10-15 02:10:11,359 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2019-10-15 02:10:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2019-10-15 02:10:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2019-10-15 02:10:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 02:10:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-10-15 02:10:11,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-10-15 02:10:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-15 02:10:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-15 02:10:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-10-15 02:10:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-15 02:10:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-15 02:10:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-15 02:10:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-15 02:10:11,361 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-15 02:10:11,362 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-15 02:10:11,362 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-15 02:10:11,362 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-15 02:10:11,362 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-10-15 02:10:11,362 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-15 02:10:11,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-10-15 02:10:11,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-15 02:10:11,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-10-15 02:10:11,363 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-15 02:10:11,363 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-15 02:10:11,363 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-15 02:10:11,363 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-15 02:10:11,363 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-15 02:10:11,363 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-10-15 02:10:11,364 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-15 02:10:11,364 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-15 02:10:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 02:10:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure __le16_to_cpup [2019-10-15 02:10:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 02:10:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-15 02:10:11,364 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-15 02:10:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-15 02:10:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-15 02:10:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-15 02:10:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-15 02:10:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-15 02:10:11,365 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2019-10-15 02:10:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2019-10-15 02:10:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-15 02:10:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-15 02:10:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2019-10-15 02:10:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-10-15 02:10:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-15 02:10:11,366 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 02:10:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-15 02:10:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 02:10:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-15 02:10:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-15 02:10:11,367 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-15 02:10:11,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2019-10-15 02:10:11,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 02:10:11,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 02:10:11,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-10-15 02:10:11,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-15 02:10:11,368 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-10-15 02:10:11,369 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-15 02:10:11,369 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-15 02:10:11,369 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-15 02:10:11,369 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-15 02:10:11,369 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-15 02:10:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-15 02:10:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-10-15 02:10:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-10-15 02:10:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-15 02:10:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-15 02:10:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-15 02:10:11,370 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-15 02:10:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-10-15 02:10:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-15 02:10:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-10-15 02:10:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-10-15 02:10:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2019-10-15 02:10:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_irq [2019-10-15 02:10:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_open [2019-10-15 02:10:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_close [2019-10-15 02:10:11,371 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2019-10-15 02:10:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2019-10-15 02:10:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2019-10-15 02:10:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2019-10-15 02:10:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-15 02:10:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-10-15 02:10:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-15 02:10:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 02:10:11,372 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 02:10:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-10-15 02:10:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-10-15 02:10:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-10-15 02:10:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-15 02:10:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-15 02:10:11,373 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 02:10:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 02:10:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 02:10:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 02:10:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 02:10:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 02:10:11,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 02:10:11,939 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 02:10:11,985 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-15 02:10:11,985 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-15 02:10:12,275 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-15 02:10:12,329 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-15 02:10:12,330 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-15 02:10:12,532 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-10-15 02:10:13,403 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 02:10:13,403 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-15 02:10:13,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:10:13 BoogieIcfgContainer [2019-10-15 02:10:13,405 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 02:10:13,407 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 02:10:13,407 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 02:10:13,412 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 02:10:13,412 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:10:09" (1/3) ... [2019-10-15 02:10:13,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d33d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:10:13, skipping insertion in model container [2019-10-15 02:10:13,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:10:11" (2/3) ... [2019-10-15 02:10:13,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29d33d2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:10:13, skipping insertion in model container [2019-10-15 02:10:13,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:10:13" (3/3) ... [2019-10-15 02:10:13,425 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-15 02:10:13,437 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 02:10:13,453 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 02:10:13,469 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 02:10:13,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 02:10:13,511 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 02:10:13,511 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 02:10:13,511 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 02:10:13,511 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 02:10:13,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 02:10:13,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 02:10:13,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 02:10:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states. [2019-10-15 02:10:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-15 02:10:13,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:13,558 INFO L380 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] [2019-10-15 02:10:13,561 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:13,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:13,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1838643444, now seen corresponding path program 1 times [2019-10-15 02:10:13,580 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:13,580 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025737904] [2019-10-15 02:10:13,580 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:13,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:13,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:13,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:14,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:10:14,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025737904] [2019-10-15 02:10:14,108 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:14,108 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:10:14,108 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828354192] [2019-10-15 02:10:14,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:10:14,114 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:14,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:10:14,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:14,131 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 3 states. [2019-10-15 02:10:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:14,229 INFO L93 Difference]: Finished difference Result 528 states and 654 transitions. [2019-10-15 02:10:14,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:10:14,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-10-15 02:10:14,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:14,249 INFO L225 Difference]: With dead ends: 528 [2019-10-15 02:10:14,249 INFO L226 Difference]: Without dead ends: 327 [2019-10-15 02:10:14,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:14,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-10-15 02:10:14,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 322. [2019-10-15 02:10:14,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2019-10-15 02:10:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 370 transitions. [2019-10-15 02:10:14,350 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 370 transitions. Word has length 25 [2019-10-15 02:10:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:14,351 INFO L462 AbstractCegarLoop]: Abstraction has 322 states and 370 transitions. [2019-10-15 02:10:14,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:10:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 370 transitions. [2019-10-15 02:10:14,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-15 02:10:14,352 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:14,352 INFO L380 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] [2019-10-15 02:10:14,353 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:14,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:14,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1163173868, now seen corresponding path program 1 times [2019-10-15 02:10:14,354 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:14,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73298615] [2019-10-15 02:10:14,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:14,355 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:14,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:14,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:14,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:10:14,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73298615] [2019-10-15 02:10:14,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:14,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:10:14,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356635619] [2019-10-15 02:10:14,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:10:14,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:14,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:10:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:14,535 INFO L87 Difference]: Start difference. First operand 322 states and 370 transitions. Second operand 3 states. [2019-10-15 02:10:14,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:14,584 INFO L93 Difference]: Finished difference Result 741 states and 856 transitions. [2019-10-15 02:10:14,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:10:14,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-10-15 02:10:14,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:14,593 INFO L225 Difference]: With dead ends: 741 [2019-10-15 02:10:14,594 INFO L226 Difference]: Without dead ends: 431 [2019-10-15 02:10:14,601 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-10-15 02:10:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 425. [2019-10-15 02:10:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2019-10-15 02:10:14,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 488 transitions. [2019-10-15 02:10:14,651 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 488 transitions. Word has length 26 [2019-10-15 02:10:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:14,652 INFO L462 AbstractCegarLoop]: Abstraction has 425 states and 488 transitions. [2019-10-15 02:10:14,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:10:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 488 transitions. [2019-10-15 02:10:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 02:10:14,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:14,657 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:14,657 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:14,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:14,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1952461806, now seen corresponding path program 1 times [2019-10-15 02:10:14,658 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:14,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131303437] [2019-10-15 02:10:14,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:14,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:14,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:14,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:10:14,820 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131303437] [2019-10-15 02:10:14,821 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:14,821 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:10:14,821 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238167920] [2019-10-15 02:10:14,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:10:14,822 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:14,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:10:14,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:14,823 INFO L87 Difference]: Start difference. First operand 425 states and 488 transitions. Second operand 3 states. [2019-10-15 02:10:14,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:14,901 INFO L93 Difference]: Finished difference Result 853 states and 996 transitions. [2019-10-15 02:10:14,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:10:14,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-10-15 02:10:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:14,911 INFO L225 Difference]: With dead ends: 853 [2019-10-15 02:10:14,911 INFO L226 Difference]: Without dead ends: 448 [2019-10-15 02:10:14,916 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:14,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2019-10-15 02:10:14,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2019-10-15 02:10:14,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-10-15 02:10:14,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 519 transitions. [2019-10-15 02:10:14,969 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 519 transitions. Word has length 61 [2019-10-15 02:10:14,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:14,972 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 519 transitions. [2019-10-15 02:10:14,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:10:14,973 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 519 transitions. [2019-10-15 02:10:14,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-15 02:10:14,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:14,984 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:14,985 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:14,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:14,986 INFO L82 PathProgramCache]: Analyzing trace with hash -119762277, now seen corresponding path program 1 times [2019-10-15 02:10:14,986 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:14,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570401384] [2019-10-15 02:10:14,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:14,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:14,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:15,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:15,247 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 02:10:15,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570401384] [2019-10-15 02:10:15,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:15,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 02:10:15,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473973250] [2019-10-15 02:10:15,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 02:10:15,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:15,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 02:10:15,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 02:10:15,250 INFO L87 Difference]: Start difference. First operand 448 states and 519 transitions. Second operand 7 states. [2019-10-15 02:10:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:16,430 INFO L93 Difference]: Finished difference Result 794 states and 922 transitions. [2019-10-15 02:10:16,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 02:10:16,431 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2019-10-15 02:10:16,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:16,437 INFO L225 Difference]: With dead ends: 794 [2019-10-15 02:10:16,437 INFO L226 Difference]: Without dead ends: 467 [2019-10-15 02:10:16,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:10:16,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-10-15 02:10:16,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 344. [2019-10-15 02:10:16,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-10-15 02:10:16,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 394 transitions. [2019-10-15 02:10:16,484 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 394 transitions. Word has length 108 [2019-10-15 02:10:16,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:16,485 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 394 transitions. [2019-10-15 02:10:16,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 02:10:16,486 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 394 transitions. [2019-10-15 02:10:16,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-15 02:10:16,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:16,493 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:16,493 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:16,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:16,494 INFO L82 PathProgramCache]: Analyzing trace with hash -864977968, now seen corresponding path program 1 times [2019-10-15 02:10:16,494 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:16,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11981936] [2019-10-15 02:10:16,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:16,495 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:16,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:16,751 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 02:10:16,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11981936] [2019-10-15 02:10:16,752 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:16,752 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 02:10:16,752 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388516144] [2019-10-15 02:10:16,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 02:10:16,753 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:16,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 02:10:16,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:10:16,754 INFO L87 Difference]: Start difference. First operand 344 states and 394 transitions. Second operand 8 states. [2019-10-15 02:10:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:18,712 INFO L93 Difference]: Finished difference Result 687 states and 798 transitions. [2019-10-15 02:10:18,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 02:10:18,713 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 106 [2019-10-15 02:10:18,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:18,719 INFO L225 Difference]: With dead ends: 687 [2019-10-15 02:10:18,719 INFO L226 Difference]: Without dead ends: 684 [2019-10-15 02:10:18,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:10:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2019-10-15 02:10:18,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 648. [2019-10-15 02:10:18,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-15 02:10:18,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 755 transitions. [2019-10-15 02:10:18,755 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 755 transitions. Word has length 106 [2019-10-15 02:10:18,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:18,756 INFO L462 AbstractCegarLoop]: Abstraction has 648 states and 755 transitions. [2019-10-15 02:10:18,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 02:10:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 755 transitions. [2019-10-15 02:10:18,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 02:10:18,797 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:18,797 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:18,797 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:18,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:18,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1389176690, now seen corresponding path program 1 times [2019-10-15 02:10:18,798 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:18,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843990456] [2019-10-15 02:10:18,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:18,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:18,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-15 02:10:19,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843990456] [2019-10-15 02:10:19,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:19,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:10:19,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784120437] [2019-10-15 02:10:19,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:10:19,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:19,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:10:19,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:10:19,013 INFO L87 Difference]: Start difference. First operand 648 states and 755 transitions. Second operand 6 states. [2019-10-15 02:10:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:19,093 INFO L93 Difference]: Finished difference Result 1145 states and 1343 transitions. [2019-10-15 02:10:19,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 02:10:19,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-10-15 02:10:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:19,097 INFO L225 Difference]: With dead ends: 1145 [2019-10-15 02:10:19,097 INFO L226 Difference]: Without dead ends: 490 [2019-10-15 02:10:19,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 02:10:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2019-10-15 02:10:19,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 472. [2019-10-15 02:10:19,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-15 02:10:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 558 transitions. [2019-10-15 02:10:19,125 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 558 transitions. Word has length 122 [2019-10-15 02:10:19,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:19,126 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 558 transitions. [2019-10-15 02:10:19,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:10:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 558 transitions. [2019-10-15 02:10:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 02:10:19,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:19,128 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:19,128 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:19,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash -582616881, now seen corresponding path program 1 times [2019-10-15 02:10:19,129 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:19,129 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509236856] [2019-10-15 02:10:19,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:19,129 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:19,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:19,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 02:10:19,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509236856] [2019-10-15 02:10:19,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:19,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:10:19,250 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186186386] [2019-10-15 02:10:19,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:10:19,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:19,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:10:19,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:19,251 INFO L87 Difference]: Start difference. First operand 472 states and 558 transitions. Second operand 3 states. [2019-10-15 02:10:19,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:19,284 INFO L93 Difference]: Finished difference Result 840 states and 1004 transitions. [2019-10-15 02:10:19,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:10:19,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-15 02:10:19,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:19,289 INFO L225 Difference]: With dead ends: 840 [2019-10-15 02:10:19,290 INFO L226 Difference]: Without dead ends: 446 [2019-10-15 02:10:19,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2019-10-15 02:10:19,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2019-10-15 02:10:19,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2019-10-15 02:10:19,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 517 transitions. [2019-10-15 02:10:19,315 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 517 transitions. Word has length 130 [2019-10-15 02:10:19,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:19,315 INFO L462 AbstractCegarLoop]: Abstraction has 446 states and 517 transitions. [2019-10-15 02:10:19,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:10:19,315 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 517 transitions. [2019-10-15 02:10:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 02:10:19,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:19,320 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:19,320 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:19,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:19,320 INFO L82 PathProgramCache]: Analyzing trace with hash 703227700, now seen corresponding path program 1 times [2019-10-15 02:10:19,320 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:19,321 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621863613] [2019-10-15 02:10:19,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:19,321 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:19,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:19,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 02:10:19,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621863613] [2019-10-15 02:10:19,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:19,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 02:10:19,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402114711] [2019-10-15 02:10:19,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 02:10:19,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:19,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 02:10:19,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 02:10:19,518 INFO L87 Difference]: Start difference. First operand 446 states and 517 transitions. Second operand 7 states. [2019-10-15 02:10:20,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:20,228 INFO L93 Difference]: Finished difference Result 481 states and 557 transitions. [2019-10-15 02:10:20,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 02:10:20,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2019-10-15 02:10:20,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:20,233 INFO L225 Difference]: With dead ends: 481 [2019-10-15 02:10:20,233 INFO L226 Difference]: Without dead ends: 478 [2019-10-15 02:10:20,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:10:20,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2019-10-15 02:10:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 459. [2019-10-15 02:10:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-10-15 02:10:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 530 transitions. [2019-10-15 02:10:20,266 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 530 transitions. Word has length 132 [2019-10-15 02:10:20,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:20,267 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 530 transitions. [2019-10-15 02:10:20,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 02:10:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 530 transitions. [2019-10-15 02:10:20,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 02:10:20,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:20,270 INFO L380 BasicCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:20,270 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:20,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:20,270 INFO L82 PathProgramCache]: Analyzing trace with hash 325024172, now seen corresponding path program 1 times [2019-10-15 02:10:20,271 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:20,271 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000553716] [2019-10-15 02:10:20,271 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:20,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:20,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:20,616 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 02:10:20,617 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000553716] [2019-10-15 02:10:20,617 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:20,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 02:10:20,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369746459] [2019-10-15 02:10:20,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 02:10:20,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:20,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 02:10:20,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:10:20,619 INFO L87 Difference]: Start difference. First operand 459 states and 530 transitions. Second operand 8 states. [2019-10-15 02:10:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:22,208 INFO L93 Difference]: Finished difference Result 954 states and 1139 transitions. [2019-10-15 02:10:22,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 02:10:22,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-10-15 02:10:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:22,213 INFO L225 Difference]: With dead ends: 954 [2019-10-15 02:10:22,213 INFO L226 Difference]: Without dead ends: 735 [2019-10-15 02:10:22,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:10:22,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2019-10-15 02:10:22,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 687. [2019-10-15 02:10:22,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2019-10-15 02:10:22,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 819 transitions. [2019-10-15 02:10:22,253 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 819 transitions. Word has length 133 [2019-10-15 02:10:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:22,254 INFO L462 AbstractCegarLoop]: Abstraction has 687 states and 819 transitions. [2019-10-15 02:10:22,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 02:10:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 819 transitions. [2019-10-15 02:10:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-15 02:10:22,256 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:22,256 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:22,257 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:22,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:22,257 INFO L82 PathProgramCache]: Analyzing trace with hash 2093508702, now seen corresponding path program 1 times [2019-10-15 02:10:22,257 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:22,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515812974] [2019-10-15 02:10:22,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:22,258 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:22,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:22,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:22,592 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 02:10:22,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515812974] [2019-10-15 02:10:22,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:22,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 02:10:22,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060490463] [2019-10-15 02:10:22,594 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 02:10:22,594 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:22,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 02:10:22,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:10:22,595 INFO L87 Difference]: Start difference. First operand 687 states and 819 transitions. Second operand 8 states. [2019-10-15 02:10:24,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:24,447 INFO L93 Difference]: Finished difference Result 1167 states and 1408 transitions. [2019-10-15 02:10:24,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 02:10:24,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 148 [2019-10-15 02:10:24,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:24,455 INFO L225 Difference]: With dead ends: 1167 [2019-10-15 02:10:24,455 INFO L226 Difference]: Without dead ends: 1160 [2019-10-15 02:10:24,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:10:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-10-15 02:10:24,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1111. [2019-10-15 02:10:24,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-15 02:10:24,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1344 transitions. [2019-10-15 02:10:24,521 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1344 transitions. Word has length 148 [2019-10-15 02:10:24,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:24,522 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 1344 transitions. [2019-10-15 02:10:24,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 02:10:24,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1344 transitions. [2019-10-15 02:10:24,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-15 02:10:24,524 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:24,525 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:24,525 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:24,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash 2062722488, now seen corresponding path program 1 times [2019-10-15 02:10:24,525 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:24,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689639700] [2019-10-15 02:10:24,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:24,526 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:24,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:24,667 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 02:10:24,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689639700] [2019-10-15 02:10:24,668 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:24,668 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 02:10:24,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570201673] [2019-10-15 02:10:24,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 02:10:24,669 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:24,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 02:10:24,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:10:24,669 INFO L87 Difference]: Start difference. First operand 1111 states and 1344 transitions. Second operand 5 states. [2019-10-15 02:10:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:24,812 INFO L93 Difference]: Finished difference Result 1163 states and 1398 transitions. [2019-10-15 02:10:24,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 02:10:24,812 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-15 02:10:24,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:24,819 INFO L225 Difference]: With dead ends: 1163 [2019-10-15 02:10:24,820 INFO L226 Difference]: Without dead ends: 1142 [2019-10-15 02:10:24,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 02:10:24,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-10-15 02:10:24,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1121. [2019-10-15 02:10:24,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1121 states. [2019-10-15 02:10:24,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1350 transitions. [2019-10-15 02:10:24,895 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1350 transitions. Word has length 165 [2019-10-15 02:10:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:24,896 INFO L462 AbstractCegarLoop]: Abstraction has 1121 states and 1350 transitions. [2019-10-15 02:10:24,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 02:10:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1350 transitions. [2019-10-15 02:10:24,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-15 02:10:24,898 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:24,899 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:24,899 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:24,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:24,899 INFO L82 PathProgramCache]: Analyzing trace with hash 888062377, now seen corresponding path program 1 times [2019-10-15 02:10:24,900 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:24,900 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185025037] [2019-10-15 02:10:24,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:24,900 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:24,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:24,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:25,096 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 02:10:25,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185025037] [2019-10-15 02:10:25,097 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333162104] [2019-10-15 02:10:25,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:10:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:25,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 1486 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 02:10:25,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:10:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 02:10:25,547 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:10:25,804 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 02:10:25,805 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 02:10:25,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 5 [2019-10-15 02:10:25,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100392942] [2019-10-15 02:10:25,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 02:10:25,806 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:25,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 02:10:25,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:10:25,807 INFO L87 Difference]: Start difference. First operand 1121 states and 1350 transitions. Second operand 4 states. [2019-10-15 02:10:25,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:25,945 INFO L93 Difference]: Finished difference Result 1868 states and 2217 transitions. [2019-10-15 02:10:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 02:10:25,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-10-15 02:10:25,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:25,951 INFO L225 Difference]: With dead ends: 1868 [2019-10-15 02:10:25,951 INFO L226 Difference]: Without dead ends: 842 [2019-10-15 02:10:25,954 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 334 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:10:25,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-10-15 02:10:26,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 826. [2019-10-15 02:10:26,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-10-15 02:10:26,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 944 transitions. [2019-10-15 02:10:26,007 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 944 transitions. Word has length 168 [2019-10-15 02:10:26,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:26,007 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 944 transitions. [2019-10-15 02:10:26,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 02:10:26,007 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 944 transitions. [2019-10-15 02:10:26,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-15 02:10:26,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:26,010 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:26,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:10:26,216 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:26,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:26,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1788904068, now seen corresponding path program 1 times [2019-10-15 02:10:26,217 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:26,217 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262147709] [2019-10-15 02:10:26,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:26,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:26,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:26,366 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 02:10:26,367 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262147709] [2019-10-15 02:10:26,367 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:26,367 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:10:26,367 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996758992] [2019-10-15 02:10:26,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:10:26,368 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:26,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:10:26,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:26,369 INFO L87 Difference]: Start difference. First operand 826 states and 944 transitions. Second operand 3 states. [2019-10-15 02:10:26,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:26,399 INFO L93 Difference]: Finished difference Result 1103 states and 1263 transitions. [2019-10-15 02:10:26,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:10:26,400 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 183 [2019-10-15 02:10:26,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:26,403 INFO L225 Difference]: With dead ends: 1103 [2019-10-15 02:10:26,403 INFO L226 Difference]: Without dead ends: 509 [2019-10-15 02:10:26,405 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:10:26,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2019-10-15 02:10:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2019-10-15 02:10:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 509 states. [2019-10-15 02:10:26,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 568 transitions. [2019-10-15 02:10:26,436 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 568 transitions. Word has length 183 [2019-10-15 02:10:26,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:26,437 INFO L462 AbstractCegarLoop]: Abstraction has 509 states and 568 transitions. [2019-10-15 02:10:26,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:10:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 568 transitions. [2019-10-15 02:10:26,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-15 02:10:26,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:26,440 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:26,440 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:26,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:26,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1236126625, now seen corresponding path program 1 times [2019-10-15 02:10:26,441 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:26,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431722957] [2019-10-15 02:10:26,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:26,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:26,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:26,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:26,953 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-15 02:10:26,954 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431722957] [2019-10-15 02:10:26,954 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:26,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 02:10:26,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564442337] [2019-10-15 02:10:26,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 02:10:26,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:26,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 02:10:26,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 02:10:26,957 INFO L87 Difference]: Start difference. First operand 509 states and 568 transitions. Second operand 8 states. [2019-10-15 02:10:27,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:27,859 INFO L93 Difference]: Finished difference Result 554 states and 609 transitions. [2019-10-15 02:10:27,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 02:10:27,860 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-10-15 02:10:27,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:27,863 INFO L225 Difference]: With dead ends: 554 [2019-10-15 02:10:27,863 INFO L226 Difference]: Without dead ends: 532 [2019-10-15 02:10:27,864 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:10:27,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-10-15 02:10:27,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 501. [2019-10-15 02:10:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2019-10-15 02:10:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 557 transitions. [2019-10-15 02:10:27,892 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 557 transitions. Word has length 185 [2019-10-15 02:10:27,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:27,893 INFO L462 AbstractCegarLoop]: Abstraction has 501 states and 557 transitions. [2019-10-15 02:10:27,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 02:10:27,893 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 557 transitions. [2019-10-15 02:10:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-15 02:10:27,896 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:27,896 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:27,896 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:27,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:27,897 INFO L82 PathProgramCache]: Analyzing trace with hash 302984622, now seen corresponding path program 1 times [2019-10-15 02:10:27,897 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:27,897 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925853819] [2019-10-15 02:10:27,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:27,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:27,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:28,048 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-15 02:10:28,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925853819] [2019-10-15 02:10:28,049 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:10:28,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:10:28,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054536903] [2019-10-15 02:10:28,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:10:28,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:10:28,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:10:28,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:10:28,051 INFO L87 Difference]: Start difference. First operand 501 states and 557 transitions. Second operand 6 states. [2019-10-15 02:10:28,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:10:28,120 INFO L93 Difference]: Finished difference Result 742 states and 825 transitions. [2019-10-15 02:10:28,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 02:10:28,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2019-10-15 02:10:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:10:28,123 INFO L225 Difference]: With dead ends: 742 [2019-10-15 02:10:28,123 INFO L226 Difference]: Without dead ends: 424 [2019-10-15 02:10:28,125 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 02:10:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-10-15 02:10:28,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 401. [2019-10-15 02:10:28,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2019-10-15 02:10:28,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 439 transitions. [2019-10-15 02:10:28,149 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 439 transitions. Word has length 215 [2019-10-15 02:10:28,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:10:28,149 INFO L462 AbstractCegarLoop]: Abstraction has 401 states and 439 transitions. [2019-10-15 02:10:28,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:10:28,149 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 439 transitions. [2019-10-15 02:10:28,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-15 02:10:28,152 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:10:28,152 INFO L380 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:10:28,152 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:10:28,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:10:28,153 INFO L82 PathProgramCache]: Analyzing trace with hash 808510366, now seen corresponding path program 1 times [2019-10-15 02:10:28,153 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:10:28,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035355899] [2019-10-15 02:10:28,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:28,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:10:28,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:10:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:28,713 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-10-15 02:10:28,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035355899] [2019-10-15 02:10:28,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710724478] [2019-10-15 02:10:28,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:10:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:10:29,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 1724 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-15 02:10:29,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:10:29,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,272 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-15 02:10:29,272 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:10:29,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:29,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:29,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,065 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2019-10-15 02:10:30,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 02:10:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 02:10:30,478 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-15 02:10:30,479 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [875137687] [2019-10-15 02:10:30,514 INFO L162 IcfgInterpreter]: Started Sifa with 186 locations of interest [2019-10-15 02:10:30,514 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 02:10:30,521 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 02:10:30,528 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 02:10:30,528 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 02:10:31,354 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 828 [2019-10-15 02:10:31,732 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification that was a NOOP. DAG size: 857 [2019-10-15 02:10:34,178 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 867 [2019-10-15 02:10:34,473 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 877 [2019-10-15 02:10:34,841 WARN L191 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 915 [2019-10-15 02:10:35,673 WARN L191 SmtUtils]: Spent 622.00 ms on a formula simplification that was a NOOP. DAG size: 966 [2019-10-15 02:10:36,854 WARN L191 SmtUtils]: Spent 514.00 ms on a formula simplification that was a NOOP. DAG size: 957 [2019-10-15 02:10:37,247 WARN L191 SmtUtils]: Spent 384.00 ms on a formula simplification that was a NOOP. DAG size: 957 [2019-10-15 02:10:37,654 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification that was a NOOP. DAG size: 957 [2019-10-15 02:10:38,032 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-15 02:10:38,325 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-15 02:10:38,623 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-15 02:10:38,890 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-15 02:10:39,235 WARN L191 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-15 02:10:39,491 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-15 02:10:39,811 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification that was a NOOP. DAG size: 1001 [2019-10-15 02:10:40,051 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification that was a NOOP. DAG size: 1001