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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 05:57:45,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 05:57:45,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 05:57:45,595 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 05:57:45,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 05:57:45,597 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 05:57:45,599 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 05:57:45,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 05:57:45,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 05:57:45,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 05:57:45,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 05:57:45,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 05:57:45,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 05:57:45,622 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 05:57:45,625 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 05:57:45,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 05:57:45,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 05:57:45,631 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 05:57:45,632 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 05:57:45,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 05:57:45,645 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 05:57:45,646 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 05:57:45,647 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 05:57:45,648 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 05:57:45,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 05:57:45,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 05:57:45,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 05:57:45,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 05:57:45,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 05:57:45,657 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 05:57:45,658 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 05:57:45,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 05:57:45,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 05:57:45,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 05:57:45,662 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 05:57:45,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 05:57:45,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 05:57:45,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 05:57:45,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 05:57:45,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 05:57:45,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 05:57:45,670 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-07 05:57:45,690 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 05:57:45,690 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 05:57:45,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 05:57:45,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 05:57:45,693 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 05:57:45,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 05:57:45,693 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 05:57:45,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 05:57:45,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 05:57:45,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 05:57:45,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 05:57:45,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 05:57:45,696 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 05:57:45,696 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 05:57:45,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 05:57:45,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 05:57:45,697 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 05:57:45,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 05:57:45,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 05:57:45,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 05:57:45,697 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 05:57:45,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 05:57:45,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 05:57:45,698 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 05:57:45,698 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 05:57:45,698 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 05:57:45,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 05:57:45,699 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 05:57:45,699 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-07 05:57:46,011 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 05:57:46,024 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 05:57:46,028 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 05:57:46,029 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 05:57:46,030 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 05:57:46,030 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i [2019-10-07 05:57:46,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff8864a5/9adff3fca7da4668ba069ca98215a749/FLAG473dddb7c [2019-10-07 05:57:46,855 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 05:57:46,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i [2019-10-07 05:57:46,897 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff8864a5/9adff3fca7da4668ba069ca98215a749/FLAG473dddb7c [2019-10-07 05:57:46,966 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ff8864a5/9adff3fca7da4668ba069ca98215a749 [2019-10-07 05:57:46,977 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 05:57:46,979 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 05:57:46,980 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 05:57:46,980 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 05:57:46,984 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 05:57:46,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:57:46" (1/1) ... [2019-10-07 05:57:46,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5510b8b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:46, skipping insertion in model container [2019-10-07 05:57:46,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 05:57:46" (1/1) ... [2019-10-07 05:57:46,996 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 05:57:47,090 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 05:57:48,582 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 05:57:48,630 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 05:57:48,891 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 05:57:49,150 INFO L192 MainTranslator]: Completed translation [2019-10-07 05:57:49,151 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:49 WrapperNode [2019-10-07 05:57:49,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 05:57:49,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 05:57:49,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 05:57:49,153 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 05:57:49,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:49" (1/1) ... [2019-10-07 05:57:49,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:49" (1/1) ... [2019-10-07 05:57:49,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:49" (1/1) ... [2019-10-07 05:57:49,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:49" (1/1) ... [2019-10-07 05:57:49,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:49" (1/1) ... [2019-10-07 05:57:49,451 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:49" (1/1) ... [2019-10-07 05:57:49,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:49" (1/1) ... [2019-10-07 05:57:49,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 05:57:49,493 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 05:57:49,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 05:57:49,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 05:57:49,495 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:49" (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-07 05:57:49,590 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 05:57:49,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 05:57:49,591 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-07 05:57:49,591 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-07 05:57:49,592 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2019-10-07 05:57:49,594 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2019-10-07 05:57:49,596 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2019-10-07 05:57:49,596 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2019-10-07 05:57:49,597 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-10-07 05:57:49,599 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-10-07 05:57:49,600 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-10-07 05:57:49,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-07 05:57:49,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-07 05:57:49,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-07 05:57:49,604 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-07 05:57:49,605 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-10-07 05:57:49,609 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-10-07 05:57:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-10-07 05:57:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-10-07 05:57:49,610 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-10-07 05:57:49,611 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-10-07 05:57:49,611 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_wait [2019-10-07 05:57:49,611 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_command [2019-10-07 05:57:49,611 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_completion [2019-10-07 05:57:49,612 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_req_sense [2019-10-07 05:57:49,612 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_atapi [2019-10-07 05:57:49,612 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_sleep [2019-10-07 05:57:49,612 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_poll_dsc [2019-10-07 05:57:49,612 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_media_access_cmd [2019-10-07 05:57:49,613 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_rewind [2019-10-07 05:57:49,613 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_write_fm [2019-10-07 05:57:49,613 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_reset [2019-10-07 05:57:49,613 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_ready_wait [2019-10-07 05:57:49,614 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-10-07 05:57:49,614 INFO L138 BoogieDeclarations]: Found implementation of procedure xn [2019-10-07 05:57:49,615 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_identify [2019-10-07 05:57:49,615 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_probe [2019-10-07 05:57:49,615 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_detect [2019-10-07 05:57:49,615 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_open [2019-10-07 05:57:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_ioctl [2019-10-07 05:57:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_release [2019-10-07 05:57:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_read [2019-10-07 05:57:49,616 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_write [2019-10-07 05:57:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_init [2019-10-07 05:57:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure pt_exit [2019-10-07 05:57:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 05:57:49,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-10-07 05:57:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-10-07 05:57:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-10-07 05:57:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-10-07 05:57:49,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-10-07 05:57:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-10-07 05:57:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-10-07 05:57:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-10-07 05:57:49,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-07 05:57:49,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_10 [2019-10-07 05:57:49,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-10-07 05:57:49,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_12 [2019-10-07 05:57:49,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_13 [2019-10-07 05:57:49,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_14 [2019-10-07 05:57:49,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_15 [2019-10-07 05:57:49,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_16 [2019-10-07 05:57:49,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_17 [2019-10-07 05:57:49,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-07 05:57:49,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-07 05:57:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-07 05:57:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-07 05:57:49,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-07 05:57:49,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-07 05:57:49,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-07 05:57:49,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-07 05:57:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-07 05:57:49,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-07 05:57:49,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-07 05:57:49,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-07 05:57:49,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-07 05:57:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-07 05:57:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-07 05:57:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-07 05:57:49,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-07 05:57:49,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pt_mutex [2019-10-07 05:57:49,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_pt_mutex [2019-10-07 05:57:49,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pt_mutex [2019-10-07 05:57:49,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_pt_mutex [2019-10-07 05:57:49,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_pt_mutex [2019-10-07 05:57:49,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_pt_mutex [2019-10-07 05:57:49,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pt_mutex [2019-10-07 05:57:49,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-07 05:57:49,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-07 05:57:49,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-10-07 05:57:49,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-10-07 05:57:49,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-10-07 05:57:49,633 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-10-07 05:57:49,634 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-10-07 05:57:49,634 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-10-07 05:57:49,634 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-10-07 05:57:49,634 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-10-07 05:57:49,634 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-10-07 05:57:49,635 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-07 05:57:49,635 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-07 05:57:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-07 05:57:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-07 05:57:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-10-07 05:57:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-10-07 05:57:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-10-07 05:57:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-10-07 05:57:49,637 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-10-07 05:57:49,637 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-10-07 05:57:49,637 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-10-07 05:57:49,637 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-10-07 05:57:49,638 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-07 05:57:49,638 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-10-07 05:57:49,638 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-10-07 05:57:49,639 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-07 05:57:49,639 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-07 05:57:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 05:57:49,639 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 05:57:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-07 05:57:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-07 05:57:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-07 05:57:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-07 05:57:49,640 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-10-07 05:57:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-07 05:57:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-07 05:57:49,641 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2019-10-07 05:57:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 05:57:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2019-10-07 05:57:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 05:57:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2019-10-07 05:57:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2019-10-07 05:57:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-07 05:57:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-10-07 05:57:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-07 05:57:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-10-07 05:57:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-10-07 05:57:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-10-07 05:57:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-07 05:57:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_10 [2019-10-07 05:57:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-10-07 05:57:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_13 [2019-10-07 05:57:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_15 [2019-10-07 05:57:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-07 05:57:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-10-07 05:57:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-10-07 05:57:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-10-07 05:57:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-10-07 05:57:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_12 [2019-10-07 05:57:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_14 [2019-10-07 05:57:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-07 05:57:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-07 05:57:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-07 05:57:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-07 05:57:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-07 05:57:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pt_mutex [2019-10-07 05:57:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pt_mutex [2019-10-07 05:57:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 05:57:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-10-07 05:57:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-10-07 05:57:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-10-07 05:57:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-10-07 05:57:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_16 [2019-10-07 05:57:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-10-07 05:57:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_17 [2019-10-07 05:57:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-10-07 05:57:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-10-07 05:57:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-07 05:57:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 05:57:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-07 05:57:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-07 05:57:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-07 05:57:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-07 05:57:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-07 05:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-07 05:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-10-07 05:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-10-07 05:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-10-07 05:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-10-07 05:57:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-10-07 05:57:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-10-07 05:57:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-10-07 05:57:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-10-07 05:57:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-10-07 05:57:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-10-07 05:57:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-10-07 05:57:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-10-07 05:57:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-10-07 05:57:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-10-07 05:57:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-10-07 05:57:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-10-07 05:57:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-10-07 05:57:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure pt_open [2019-10-07 05:57:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure pt_ioctl [2019-10-07 05:57:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure pt_release [2019-10-07 05:57:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure pt_read [2019-10-07 05:57:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure pt_write [2019-10-07 05:57:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure pt_detect [2019-10-07 05:57:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure pt_identify [2019-10-07 05:57:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-10-07 05:57:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-10-07 05:57:49,666 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-10-07 05:57:49,667 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-10-07 05:57:49,667 INFO L130 BoogieDeclarations]: Found specification of procedure pt_wait [2019-10-07 05:57:49,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-07 05:57:49,667 INFO L130 BoogieDeclarations]: Found specification of procedure pt_command [2019-10-07 05:57:49,667 INFO L130 BoogieDeclarations]: Found specification of procedure pt_completion [2019-10-07 05:57:49,667 INFO L130 BoogieDeclarations]: Found specification of procedure pt_req_sense [2019-10-07 05:57:49,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 05:57:49,668 INFO L130 BoogieDeclarations]: Found specification of procedure pt_atapi [2019-10-07 05:57:49,668 INFO L130 BoogieDeclarations]: Found specification of procedure pt_sleep [2019-10-07 05:57:49,668 INFO L130 BoogieDeclarations]: Found specification of procedure pt_poll_dsc [2019-10-07 05:57:49,668 INFO L130 BoogieDeclarations]: Found specification of procedure pt_media_access_cmd [2019-10-07 05:57:49,668 INFO L130 BoogieDeclarations]: Found specification of procedure pt_rewind [2019-10-07 05:57:49,668 INFO L130 BoogieDeclarations]: Found specification of procedure pt_write_fm [2019-10-07 05:57:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure pt_reset [2019-10-07 05:57:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure pt_ready_wait [2019-10-07 05:57:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-10-07 05:57:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure xn [2019-10-07 05:57:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-07 05:57:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure pt_probe [2019-10-07 05:57:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure pt_init [2019-10-07 05:57:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure pt_exit [2019-10-07 05:57:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-07 05:57:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-07 05:57:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 05:57:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-07 05:57:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-07 05:57:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-07 05:57:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-07 05:57:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-07 05:57:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-07 05:57:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-07 05:57:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-07 05:57:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-07 05:57:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-07 05:57:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-07 05:57:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-07 05:57:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pt_mutex [2019-10-07 05:57:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_pt_mutex [2019-10-07 05:57:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_pt_mutex [2019-10-07 05:57:49,672 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_pt_mutex [2019-10-07 05:57:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_pt_mutex [2019-10-07 05:57:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-07 05:57:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-07 05:57:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-07 05:57:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-07 05:57:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-07 05:57:49,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 05:57:49,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-07 05:57:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-07 05:57:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 05:58:00,019 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 05:58:00,020 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-07 05:58:00,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:58:00 BoogieIcfgContainer [2019-10-07 05:58:00,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 05:58:00,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 05:58:00,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 05:58:00,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 05:58:00,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 05:57:46" (1/3) ... [2019-10-07 05:58:00,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3673a0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:58:00, skipping insertion in model container [2019-10-07 05:58:00,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 05:57:49" (2/3) ... [2019-10-07 05:58:00,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3673a0f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 05:58:00, skipping insertion in model container [2019-10-07 05:58:00,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 05:58:00" (3/3) ... [2019-10-07 05:58:00,031 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pt.ko-main.cil.out.i [2019-10-07 05:58:00,042 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 05:58:00,053 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 05:58:00,065 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 05:58:00,100 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 05:58:00,100 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 05:58:00,100 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 05:58:00,100 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 05:58:00,100 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 05:58:00,100 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 05:58:00,101 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 05:58:00,101 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 05:58:00,140 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states. [2019-10-07 05:58:00,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-07 05:58:00,151 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:00,152 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:58:00,154 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:00,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:00,161 INFO L82 PathProgramCache]: Analyzing trace with hash -2135758099, now seen corresponding path program 1 times [2019-10-07 05:58:00,171 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:00,172 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:00,172 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:00,172 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:00,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:00,856 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-07 05:58:00,856 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:00,857 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:00,857 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:58:00,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:58:00,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:58:00,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:58:00,881 INFO L87 Difference]: Start difference. First operand 761 states. Second operand 3 states. [2019-10-07 05:58:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:01,154 INFO L93 Difference]: Finished difference Result 1660 states and 2330 transitions. [2019-10-07 05:58:01,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:01,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-10-07 05:58:01,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:01,189 INFO L225 Difference]: With dead ends: 1660 [2019-10-07 05:58:01,189 INFO L226 Difference]: Without dead ends: 964 [2019-10-07 05:58:01,200 INFO L606 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-07 05:58:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2019-10-07 05:58:01,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 921. [2019-10-07 05:58:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-10-07 05:58:01,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1246 transitions. [2019-10-07 05:58:01,358 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1246 transitions. Word has length 28 [2019-10-07 05:58:01,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:01,359 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1246 transitions. [2019-10-07 05:58:01,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:58:01,359 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1246 transitions. [2019-10-07 05:58:01,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-07 05:58:01,376 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:01,377 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:58:01,377 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:01,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:01,377 INFO L82 PathProgramCache]: Analyzing trace with hash 253566313, now seen corresponding path program 1 times [2019-10-07 05:58:01,378 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:01,378 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:01,378 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:01,378 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:01,618 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-07 05:58:01,618 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:01,618 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:01,619 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 05:58:01,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 05:58:01,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 05:58:01,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 05:58:01,621 INFO L87 Difference]: Start difference. First operand 921 states and 1246 transitions. Second operand 4 states. [2019-10-07 05:58:03,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:03,171 INFO L93 Difference]: Finished difference Result 1833 states and 2485 transitions. [2019-10-07 05:58:03,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:03,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-07 05:58:03,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:03,183 INFO L225 Difference]: With dead ends: 1833 [2019-10-07 05:58:03,184 INFO L226 Difference]: Without dead ends: 921 [2019-10-07 05:58:03,194 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 05:58:03,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-10-07 05:58:03,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2019-10-07 05:58:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2019-10-07 05:58:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1244 transitions. [2019-10-07 05:58:03,257 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1244 transitions. Word has length 27 [2019-10-07 05:58:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:03,258 INFO L462 AbstractCegarLoop]: Abstraction has 921 states and 1244 transitions. [2019-10-07 05:58:03,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 05:58:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1244 transitions. [2019-10-07 05:58:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-07 05:58:03,260 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:03,261 INFO L385 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] [2019-10-07 05:58:03,261 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:03,261 INFO L82 PathProgramCache]: Analyzing trace with hash 250768757, now seen corresponding path program 1 times [2019-10-07 05:58:03,262 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:03,262 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:03,262 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:03,262 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:03,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:03,403 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-07 05:58:03,404 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:03,404 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:03,404 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:58:03,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:58:03,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:58:03,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:58:03,405 INFO L87 Difference]: Start difference. First operand 921 states and 1244 transitions. Second operand 3 states. [2019-10-07 05:58:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:03,517 INFO L93 Difference]: Finished difference Result 1859 states and 2527 transitions. [2019-10-07 05:58:03,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:03,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-07 05:58:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:03,527 INFO L225 Difference]: With dead ends: 1859 [2019-10-07 05:58:03,527 INFO L226 Difference]: Without dead ends: 947 [2019-10-07 05:58:03,532 INFO L606 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-07 05:58:03,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-10-07 05:58:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 923. [2019-10-07 05:58:03,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 923 states. [2019-10-07 05:58:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 923 states to 923 states and 1246 transitions. [2019-10-07 05:58:03,593 INFO L78 Accepts]: Start accepts. Automaton has 923 states and 1246 transitions. Word has length 35 [2019-10-07 05:58:03,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:03,594 INFO L462 AbstractCegarLoop]: Abstraction has 923 states and 1246 transitions. [2019-10-07 05:58:03,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:58:03,594 INFO L276 IsEmpty]: Start isEmpty. Operand 923 states and 1246 transitions. [2019-10-07 05:58:03,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-07 05:58:03,596 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:03,596 INFO L385 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] [2019-10-07 05:58:03,597 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:03,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:03,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1659733765, now seen corresponding path program 1 times [2019-10-07 05:58:03,597 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:03,598 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:03,598 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:03,598 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:03,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:03,747 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-07 05:58:03,747 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:03,748 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:03,748 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:58:03,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:58:03,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:58:03,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:58:03,749 INFO L87 Difference]: Start difference. First operand 923 states and 1246 transitions. Second operand 3 states. [2019-10-07 05:58:04,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:04,271 INFO L93 Difference]: Finished difference Result 2015 states and 2712 transitions. [2019-10-07 05:58:04,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:04,271 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-07 05:58:04,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:04,280 INFO L225 Difference]: With dead ends: 2015 [2019-10-07 05:58:04,281 INFO L226 Difference]: Without dead ends: 1101 [2019-10-07 05:58:04,286 INFO L606 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-07 05:58:04,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1101 states. [2019-10-07 05:58:04,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1101 to 1101. [2019-10-07 05:58:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2019-10-07 05:58:04,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1472 transitions. [2019-10-07 05:58:04,347 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1472 transitions. Word has length 40 [2019-10-07 05:58:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:04,348 INFO L462 AbstractCegarLoop]: Abstraction has 1101 states and 1472 transitions. [2019-10-07 05:58:04,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:58:04,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1472 transitions. [2019-10-07 05:58:04,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-10-07 05:58:04,350 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:04,350 INFO L385 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] [2019-10-07 05:58:04,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:04,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:04,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1078756022, now seen corresponding path program 1 times [2019-10-07 05:58:04,351 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:04,351 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:04,351 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:04,351 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:04,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:04,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:58:04,538 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:04,538 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:04,538 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:58:04,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:58:04,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:58:04,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:58:04,540 INFO L87 Difference]: Start difference. First operand 1101 states and 1472 transitions. Second operand 3 states. [2019-10-07 05:58:04,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:04,611 INFO L93 Difference]: Finished difference Result 2200 states and 2952 transitions. [2019-10-07 05:58:04,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:04,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-10-07 05:58:04,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:04,621 INFO L225 Difference]: With dead ends: 2200 [2019-10-07 05:58:04,621 INFO L226 Difference]: Without dead ends: 1117 [2019-10-07 05:58:04,627 INFO L606 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-07 05:58:04,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-10-07 05:58:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1113. [2019-10-07 05:58:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1113 states. [2019-10-07 05:58:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1490 transitions. [2019-10-07 05:58:04,698 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1490 transitions. Word has length 42 [2019-10-07 05:58:04,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:04,699 INFO L462 AbstractCegarLoop]: Abstraction has 1113 states and 1490 transitions. [2019-10-07 05:58:04,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:58:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1490 transitions. [2019-10-07 05:58:04,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-07 05:58:04,703 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:04,704 INFO L385 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] [2019-10-07 05:58:04,704 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:04,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:04,704 INFO L82 PathProgramCache]: Analyzing trace with hash 925321270, now seen corresponding path program 1 times [2019-10-07 05:58:04,705 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:04,705 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:04,705 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:04,705 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:04,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:58:04,893 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:04,893 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:04,893 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:58:04,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:58:04,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:58:04,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:58:04,894 INFO L87 Difference]: Start difference. First operand 1113 states and 1490 transitions. Second operand 3 states. [2019-10-07 05:58:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:05,392 INFO L93 Difference]: Finished difference Result 1115 states and 1491 transitions. [2019-10-07 05:58:05,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:05,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-07 05:58:05,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:05,402 INFO L225 Difference]: With dead ends: 1115 [2019-10-07 05:58:05,402 INFO L226 Difference]: Without dead ends: 1112 [2019-10-07 05:58:05,403 INFO L606 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-07 05:58:05,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2019-10-07 05:58:05,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2019-10-07 05:58:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1112 states. [2019-10-07 05:58:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1488 transitions. [2019-10-07 05:58:05,477 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1488 transitions. Word has length 47 [2019-10-07 05:58:05,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:05,478 INFO L462 AbstractCegarLoop]: Abstraction has 1112 states and 1488 transitions. [2019-10-07 05:58:05,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:58:05,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1488 transitions. [2019-10-07 05:58:05,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-07 05:58:05,479 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:05,480 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:58:05,480 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:05,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1380369154, now seen corresponding path program 1 times [2019-10-07 05:58:05,481 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:05,481 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:05,481 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:05,481 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:05,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:05,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:58:05,670 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:05,670 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:05,670 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:58:05,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:58:05,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:58:05,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:58:05,672 INFO L87 Difference]: Start difference. First operand 1112 states and 1488 transitions. Second operand 3 states. [2019-10-07 05:58:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:06,159 INFO L93 Difference]: Finished difference Result 1114 states and 1489 transitions. [2019-10-07 05:58:06,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:06,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-07 05:58:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:06,168 INFO L225 Difference]: With dead ends: 1114 [2019-10-07 05:58:06,168 INFO L226 Difference]: Without dead ends: 1111 [2019-10-07 05:58:06,169 INFO L606 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-07 05:58:06,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2019-10-07 05:58:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2019-10-07 05:58:06,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-07 05:58:06,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1486 transitions. [2019-10-07 05:58:06,229 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1486 transitions. Word has length 48 [2019-10-07 05:58:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:06,229 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 1486 transitions. [2019-10-07 05:58:06,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:58:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1486 transitions. [2019-10-07 05:58:06,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-07 05:58:06,230 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:06,231 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:58:06,231 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:06,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:06,231 INFO L82 PathProgramCache]: Analyzing trace with hash 157676601, now seen corresponding path program 1 times [2019-10-07 05:58:06,232 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:06,232 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:06,232 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:06,232 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:06,354 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:58:06,354 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:06,355 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:06,355 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:58:06,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:58:06,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:58:06,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:58:06,356 INFO L87 Difference]: Start difference. First operand 1111 states and 1486 transitions. Second operand 3 states. [2019-10-07 05:58:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:07,035 INFO L93 Difference]: Finished difference Result 1113 states and 1487 transitions. [2019-10-07 05:58:07,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:07,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-07 05:58:07,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:07,044 INFO L225 Difference]: With dead ends: 1113 [2019-10-07 05:58:07,044 INFO L226 Difference]: Without dead ends: 1110 [2019-10-07 05:58:07,045 INFO L606 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-07 05:58:07,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2019-10-07 05:58:07,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2019-10-07 05:58:07,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1110 states. [2019-10-07 05:58:07,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1484 transitions. [2019-10-07 05:58:07,109 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1484 transitions. Word has length 49 [2019-10-07 05:58:07,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:07,110 INFO L462 AbstractCegarLoop]: Abstraction has 1110 states and 1484 transitions. [2019-10-07 05:58:07,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:58:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1484 transitions. [2019-10-07 05:58:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-07 05:58:07,111 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:07,111 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:58:07,111 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:07,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:07,112 INFO L82 PathProgramCache]: Analyzing trace with hash 592459617, now seen corresponding path program 1 times [2019-10-07 05:58:07,112 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:07,112 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:07,112 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:07,112 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:07,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:07,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:58:07,245 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:07,245 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:07,245 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:58:07,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:58:07,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:58:07,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:58:07,248 INFO L87 Difference]: Start difference. First operand 1110 states and 1484 transitions. Second operand 3 states. [2019-10-07 05:58:07,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:07,962 INFO L93 Difference]: Finished difference Result 1271 states and 1688 transitions. [2019-10-07 05:58:07,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:07,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-07 05:58:07,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:07,973 INFO L225 Difference]: With dead ends: 1271 [2019-10-07 05:58:07,974 INFO L226 Difference]: Without dead ends: 1229 [2019-10-07 05:58:07,975 INFO L606 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-07 05:58:07,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-10-07 05:58:08,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1229. [2019-10-07 05:58:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1229 states. [2019-10-07 05:58:08,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1637 transitions. [2019-10-07 05:58:08,051 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1637 transitions. Word has length 50 [2019-10-07 05:58:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:08,051 INFO L462 AbstractCegarLoop]: Abstraction has 1229 states and 1637 transitions. [2019-10-07 05:58:08,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:58:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1637 transitions. [2019-10-07 05:58:08,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-07 05:58:08,056 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:08,056 INFO L385 BasicCegarLoop]: trace histogram [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] [2019-10-07 05:58:08,057 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:08,058 INFO L82 PathProgramCache]: Analyzing trace with hash 171832610, now seen corresponding path program 1 times [2019-10-07 05:58:08,058 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:08,058 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:08,058 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:08,058 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:08,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:58:08,254 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:08,255 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:08,255 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 05:58:08,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 05:58:08,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 05:58:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 05:58:08,257 INFO L87 Difference]: Start difference. First operand 1229 states and 1637 transitions. Second operand 6 states. [2019-10-07 05:58:08,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:08,415 INFO L93 Difference]: Finished difference Result 2496 states and 3342 transitions. [2019-10-07 05:58:08,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 05:58:08,416 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-10-07 05:58:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:08,427 INFO L225 Difference]: With dead ends: 2496 [2019-10-07 05:58:08,427 INFO L226 Difference]: Without dead ends: 1285 [2019-10-07 05:58:08,435 INFO L606 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-07 05:58:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2019-10-07 05:58:08,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1285. [2019-10-07 05:58:08,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1285 states. [2019-10-07 05:58:08,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1721 transitions. [2019-10-07 05:58:08,517 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1721 transitions. Word has length 90 [2019-10-07 05:58:08,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:08,517 INFO L462 AbstractCegarLoop]: Abstraction has 1285 states and 1721 transitions. [2019-10-07 05:58:08,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 05:58:08,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1721 transitions. [2019-10-07 05:58:08,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-07 05:58:08,525 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:08,525 INFO L385 BasicCegarLoop]: trace histogram [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-07 05:58:08,525 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:08,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:08,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1196424685, now seen corresponding path program 1 times [2019-10-07 05:58:08,526 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:08,526 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:08,526 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:08,527 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:08,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-07 05:58:08,678 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:08,678 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:08,678 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 05:58:08,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 05:58:08,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 05:58:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:58:08,680 INFO L87 Difference]: Start difference. First operand 1285 states and 1721 transitions. Second operand 5 states. [2019-10-07 05:58:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:08,776 INFO L93 Difference]: Finished difference Result 2580 states and 3468 transitions. [2019-10-07 05:58:08,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 05:58:08,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-07 05:58:08,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:08,792 INFO L225 Difference]: With dead ends: 2580 [2019-10-07 05:58:08,792 INFO L226 Difference]: Without dead ends: 1313 [2019-10-07 05:58:08,802 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:58:08,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-10-07 05:58:08,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1297. [2019-10-07 05:58:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1297 states. [2019-10-07 05:58:08,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1739 transitions. [2019-10-07 05:58:08,909 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1739 transitions. Word has length 100 [2019-10-07 05:58:08,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:08,909 INFO L462 AbstractCegarLoop]: Abstraction has 1297 states and 1739 transitions. [2019-10-07 05:58:08,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 05:58:08,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1739 transitions. [2019-10-07 05:58:08,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-07 05:58:08,915 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:08,915 INFO L385 BasicCegarLoop]: trace histogram [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-07 05:58:08,916 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:08,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:08,916 INFO L82 PathProgramCache]: Analyzing trace with hash -305324997, now seen corresponding path program 1 times [2019-10-07 05:58:08,916 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:08,916 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:08,917 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:08,917 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:08,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:09,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:09,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 05:58:09,089 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:09,090 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:09,090 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 05:58:09,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 05:58:09,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 05:58:09,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:58:09,091 INFO L87 Difference]: Start difference. First operand 1297 states and 1739 transitions. Second operand 5 states. [2019-10-07 05:58:09,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:09,198 INFO L93 Difference]: Finished difference Result 2688 states and 3638 transitions. [2019-10-07 05:58:09,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-07 05:58:09,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-07 05:58:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:09,210 INFO L225 Difference]: With dead ends: 2688 [2019-10-07 05:58:09,210 INFO L226 Difference]: Without dead ends: 1409 [2019-10-07 05:58:09,219 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-07 05:58:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2019-10-07 05:58:09,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1305. [2019-10-07 05:58:09,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1305 states. [2019-10-07 05:58:09,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1305 states to 1305 states and 1747 transitions. [2019-10-07 05:58:09,302 INFO L78 Accepts]: Start accepts. Automaton has 1305 states and 1747 transitions. Word has length 100 [2019-10-07 05:58:09,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:09,303 INFO L462 AbstractCegarLoop]: Abstraction has 1305 states and 1747 transitions. [2019-10-07 05:58:09,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 05:58:09,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1305 states and 1747 transitions. [2019-10-07 05:58:09,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-07 05:58:09,310 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:09,311 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:58:09,311 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:09,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:09,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1070937834, now seen corresponding path program 1 times [2019-10-07 05:58:09,312 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:09,312 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:09,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:09,312 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:09,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:09,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:09,658 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-07 05:58:09,658 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:09,659 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:09,659 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 05:58:09,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 05:58:09,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 05:58:09,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 05:58:09,660 INFO L87 Difference]: Start difference. First operand 1305 states and 1747 transitions. Second operand 4 states. [2019-10-07 05:58:09,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:09,774 INFO L93 Difference]: Finished difference Result 2628 states and 3560 transitions. [2019-10-07 05:58:09,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 05:58:09,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-10-07 05:58:09,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:09,786 INFO L225 Difference]: With dead ends: 2628 [2019-10-07 05:58:09,787 INFO L226 Difference]: Without dead ends: 1341 [2019-10-07 05:58:09,794 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 05:58:09,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-10-07 05:58:09,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1309. [2019-10-07 05:58:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-10-07 05:58:09,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1751 transitions. [2019-10-07 05:58:09,865 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1751 transitions. Word has length 195 [2019-10-07 05:58:09,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:09,866 INFO L462 AbstractCegarLoop]: Abstraction has 1309 states and 1751 transitions. [2019-10-07 05:58:09,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 05:58:09,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1751 transitions. [2019-10-07 05:58:09,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-07 05:58:09,871 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:09,872 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 05:58:09,872 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:09,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:09,872 INFO L82 PathProgramCache]: Analyzing trace with hash 266596508, now seen corresponding path program 1 times [2019-10-07 05:58:09,873 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:09,873 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:09,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:09,873 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:09,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:10,088 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-07 05:58:10,088 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:10,089 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:10,089 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:58:10,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:58:10,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:58:10,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:58:10,090 INFO L87 Difference]: Start difference. First operand 1309 states and 1751 transitions. Second operand 3 states. [2019-10-07 05:58:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:10,181 INFO L93 Difference]: Finished difference Result 2612 states and 3530 transitions. [2019-10-07 05:58:10,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:10,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 206 [2019-10-07 05:58:10,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:10,191 INFO L225 Difference]: With dead ends: 2612 [2019-10-07 05:58:10,191 INFO L226 Difference]: Without dead ends: 1321 [2019-10-07 05:58:10,199 INFO L606 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-07 05:58:10,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-10-07 05:58:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1313. [2019-10-07 05:58:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-10-07 05:58:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1755 transitions. [2019-10-07 05:58:10,269 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1755 transitions. Word has length 206 [2019-10-07 05:58:10,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:10,270 INFO L462 AbstractCegarLoop]: Abstraction has 1313 states and 1755 transitions. [2019-10-07 05:58:10,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:58:10,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1755 transitions. [2019-10-07 05:58:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-07 05:58:10,275 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:10,275 INFO L385 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:58:10,275 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:10,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:10,276 INFO L82 PathProgramCache]: Analyzing trace with hash -965286021, now seen corresponding path program 1 times [2019-10-07 05:58:10,277 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:10,277 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:10,277 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:10,277 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:10,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:10,533 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-07 05:58:10,534 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:10,534 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:10,534 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-07 05:58:10,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-07 05:58:10,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-07 05:58:10,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:58:10,540 INFO L87 Difference]: Start difference. First operand 1313 states and 1755 transitions. Second operand 5 states. [2019-10-07 05:58:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:10,642 INFO L93 Difference]: Finished difference Result 2632 states and 3620 transitions. [2019-10-07 05:58:10,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 05:58:10,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 215 [2019-10-07 05:58:10,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:10,657 INFO L225 Difference]: With dead ends: 2632 [2019-10-07 05:58:10,657 INFO L226 Difference]: Without dead ends: 1337 [2019-10-07 05:58:10,806 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-07 05:58:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-10-07 05:58:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1329. [2019-10-07 05:58:10,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1329 states. [2019-10-07 05:58:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1785 transitions. [2019-10-07 05:58:10,908 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1785 transitions. Word has length 215 [2019-10-07 05:58:10,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:10,909 INFO L462 AbstractCegarLoop]: Abstraction has 1329 states and 1785 transitions. [2019-10-07 05:58:10,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-07 05:58:10,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1785 transitions. [2019-10-07 05:58:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-07 05:58:10,917 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:10,918 INFO L385 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:58:10,918 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:10,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash -266816140, now seen corresponding path program 1 times [2019-10-07 05:58:10,919 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:10,919 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:10,919 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:10,919 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:10,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:11,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-07 05:58:11,222 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:11,225 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 05:58:11,225 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 05:58:11,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 05:58:11,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 05:58:11,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 05:58:11,226 INFO L87 Difference]: Start difference. First operand 1329 states and 1785 transitions. Second operand 3 states. [2019-10-07 05:58:11,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:11,317 INFO L93 Difference]: Finished difference Result 2652 states and 3618 transitions. [2019-10-07 05:58:11,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 05:58:11,317 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 237 [2019-10-07 05:58:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:11,330 INFO L225 Difference]: With dead ends: 2652 [2019-10-07 05:58:11,330 INFO L226 Difference]: Without dead ends: 1341 [2019-10-07 05:58:11,338 INFO L606 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-07 05:58:11,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-10-07 05:58:11,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1333. [2019-10-07 05:58:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-10-07 05:58:11,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1789 transitions. [2019-10-07 05:58:11,417 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1789 transitions. Word has length 237 [2019-10-07 05:58:11,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:11,418 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 1789 transitions. [2019-10-07 05:58:11,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 05:58:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1789 transitions. [2019-10-07 05:58:11,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-07 05:58:11,426 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:11,426 INFO L385 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:58:11,427 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:11,427 INFO L82 PathProgramCache]: Analyzing trace with hash 276739494, now seen corresponding path program 1 times [2019-10-07 05:58:11,427 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:11,428 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:11,428 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:11,428 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:11,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:11,929 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 267 trivial. 0 not checked. [2019-10-07 05:58:11,929 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:11,929 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 05:58:11,930 INFO L95 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-07 05:58:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:12,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 3465 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-07 05:58:12,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 05:58:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-10-07 05:58:13,073 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 05:58:14,208 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2019-10-07 05:58:14,209 INFO L211 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-07 05:58:14,209 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 12 [2019-10-07 05:58:14,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 05:58:14,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 05:58:14,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-07 05:58:14,212 INFO L87 Difference]: Start difference. First operand 1333 states and 1789 transitions. Second operand 4 states. [2019-10-07 05:58:14,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 05:58:14,338 INFO L93 Difference]: Finished difference Result 2656 states and 3572 transitions. [2019-10-07 05:58:14,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 05:58:14,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 308 [2019-10-07 05:58:14,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 05:58:14,352 INFO L225 Difference]: With dead ends: 2656 [2019-10-07 05:58:14,353 INFO L226 Difference]: Without dead ends: 1341 [2019-10-07 05:58:14,360 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 626 GetRequests, 616 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-07 05:58:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2019-10-07 05:58:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1341. [2019-10-07 05:58:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2019-10-07 05:58:14,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1799 transitions. [2019-10-07 05:58:14,446 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1799 transitions. Word has length 308 [2019-10-07 05:58:14,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 05:58:14,447 INFO L462 AbstractCegarLoop]: Abstraction has 1341 states and 1799 transitions. [2019-10-07 05:58:14,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 05:58:14,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1799 transitions. [2019-10-07 05:58:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-10-07 05:58:14,455 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 05:58:14,455 INFO L385 BasicCegarLoop]: trace histogram [10, 7, 7, 7, 7, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 05:58:14,666 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 05:58:14,666 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 05:58:14,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 05:58:14,667 INFO L82 PathProgramCache]: Analyzing trace with hash 570082696, now seen corresponding path program 1 times [2019-10-07 05:58:14,667 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 05:58:14,667 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:14,668 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:14,668 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 05:58:14,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 05:58:14,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:15,214 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-10-07 05:58:15,215 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 05:58:15,215 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 05:58:15,215 INFO L95 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-07 05:58:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 05:58:16,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 3486 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-07 05:58:16,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 05:58:16,664 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-10-07 05:58:16,665 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 05:58:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-10-07 05:58:17,573 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 05:58:17,618 INFO L162 IcfgInterpreter]: Started Sifa with 202 locations of interest [2019-10-07 05:58:17,618 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 05:58:17,625 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 05:58:17,634 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 05:58:17,635 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 05:58:20,215 WARN L191 SmtUtils]: Spent 718.00 ms on a formula simplification that was a NOOP. DAG size: 1380 [2019-10-07 05:58:29,784 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification that was a NOOP. DAG size: 1382 [2019-10-07 05:58:44,496 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= ~name~0.base |#t~string91.base|) [2019-10-07 05:59:41,857 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string332.base| ~name~0.base) [2019-10-07 05:59:47,746 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string60.base| (select ~drives~0.base 0)) [2019-10-07 05:59:51,196 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select ~drives~0.base 0) |#t~string91.base|) [2019-10-07 06:00:40,028 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string331.base| (select ~drives~0.base 0)) [2019-10-07 06:00:44,052 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select ~drives~0.base 3) (select ~drives~0.base 1)) [2019-10-07 06:00:50,076 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select ~drives~0.base 1) |#t~string91.base|) [2019-10-07 06:01:28,860 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string272.base| (select ~drives~0.base 1)) [2019-10-07 06:01:36,472 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string304.base| (select ~drives~0.base 1)) [2019-10-07 06:01:47,803 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string59.base| (select ~drives~0.base 2)) [2019-10-07 06:01:51,904 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select ~drives~0.base 2) |#t~string91.base|) [2019-10-07 06:02:08,464 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select ~drives~0.base 2) |#t~string147.base|) [2019-10-07 06:02:35,311 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select ~drives~0.base 2) |#t~string274.base|) [2019-10-07 06:02:40,555 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select ~drives~0.base 2) |#t~string302.base|) [2019-10-07 06:02:50,594 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string60.base| (select ~drives~0.base 3)) [2019-10-07 06:02:53,772 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= (select ~drives~0.base 3) |#t~string91.base|) [2019-10-07 06:03:06,434 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string142.base| (select ~drives~0.base 3)) [2019-10-07 06:03:48,369 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string332.base| (select ~drives~0.base 3)) [2019-10-07 06:04:11,658 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string59.base| |#t~string170.base|) [2019-10-07 06:04:48,662 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string60.base| |#t~string112.base|) [2019-10-07 06:05:35,443 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt_fops~0.base| (select (select |v_#memory_$Pointer$.base_734| |~#pt_mutex~0.base|) (+ |~#pt_mutex~0.offset| 32))) [2019-10-07 06:06:11,450 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string263.base| (select (select |v_#memory_$Pointer$.base_734| |~#pt_mutex~0.base|) (+ |~#pt_mutex~0.offset| 32))) [2019-10-07 06:06:28,402 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt~0.base| |~#pt_mutex~0.base|) [2019-10-07 06:06:40,561 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string147.base| |~#pt_mutex~0.base|) [2019-10-07 06:07:03,568 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string272.base| |~#pt_mutex~0.base|) [2019-10-07 06:07:19,335 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt_scratch~0.base| |#t~string91.base|) [2019-10-07 06:07:44,512 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string194.base| |#t~string91.base|) [2019-10-07 06:08:10,121 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt~0.base| |#t~string101.base|) [2019-10-07 06:08:44,697 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt~0.base| |#t~string274.base|) [2019-10-07 06:08:50,733 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt~0.base| |#t~string304.base|) [2019-10-07 06:08:58,521 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string332.base| |~#pt~0.base|) [2019-10-07 06:09:11,666 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt_scratch~0.base| |#t~string147.base|) [2019-10-07 06:09:14,862 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt_scratch~0.base| |#t~string159.base|) [2019-10-07 06:09:17,442 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string162.base| |~#pt_scratch~0.base|) [2019-10-07 06:09:20,524 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string171.base| |~#pt_scratch~0.base|) [2019-10-07 06:09:30,341 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt_scratch~0.base| |#t~string199.base|) [2019-10-07 06:09:34,186 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string214.base| |~#pt_scratch~0.base|) [2019-10-07 06:09:43,233 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt_scratch~0.base| |#t~string272.base|) [2019-10-07 06:09:45,246 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt_scratch~0.base| |#t~string274.base|) [2019-10-07 06:09:51,718 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string302.base| |~#pt_scratch~0.base|) [2019-10-07 06:09:53,740 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt_scratch~0.base| |#t~string304.base|) [2019-10-07 06:09:58,187 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string329.base| |~#pt_scratch~0.base|) [2019-10-07 06:10:00,200 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string331.base| |~#pt_scratch~0.base|) [2019-10-07 06:10:04,036 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt_fops~0.base| |#t~string101.base|) [2019-10-07 06:10:06,054 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |~#pt_fops~0.base| |#t~string104.base|) [2019-10-07 06:10:09,996 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string118.base| |~#pt_fops~0.base|) [2019-10-07 06:10:32,472 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string189.base| |~#pt_fops~0.base|) [2019-10-07 06:10:59,651 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string101.base| |#t~string106.base|) [2019-10-07 06:11:17,510 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string170.base| |#t~string101.base|) [2019-10-07 06:11:50,992 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string104.base| |#t~string110.base|) [2019-10-07 06:12:07,083 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string170.base| |#t~string104.base|) [2019-10-07 06:12:10,972 WARN L160 IndexEqualityManager]: solver failed to check if following equality is implied: (= |#t~string176.base| |#t~string104.base|)