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--pg.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 02:07:49,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 02:07:49,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 02:07:49,904 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 02:07:49,905 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 02:07:49,906 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 02:07:49,907 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 02:07:49,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 02:07:49,911 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 02:07:49,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 02:07:49,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 02:07:49,913 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 02:07:49,914 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 02:07:49,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 02:07:49,916 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 02:07:49,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 02:07:49,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 02:07:49,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 02:07:49,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 02:07:49,922 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 02:07:49,923 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 02:07:49,924 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 02:07:49,925 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 02:07:49,926 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 02:07:49,928 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 02:07:49,929 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 02:07:49,929 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 02:07:49,929 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 02:07:49,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 02:07:49,931 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 02:07:49,931 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 02:07:49,932 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 02:07:49,933 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 02:07:49,933 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 02:07:49,934 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 02:07:49,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 02:07:49,935 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 02:07:49,935 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 02:07:49,936 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 02:07:49,937 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 02:07:49,937 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 02:07:49,938 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 02:07:49,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 02:07:49,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 02:07:49,954 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 02:07:49,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 02:07:49,954 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 02:07:49,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 02:07:49,955 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 02:07:49,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 02:07:49,955 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 02:07:49,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 02:07:49,955 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 02:07:49,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 02:07:49,956 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 02:07:49,956 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 02:07:49,956 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 02:07:49,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 02:07:49,957 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 02:07:49,957 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 02:07:49,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 02:07:49,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 02:07:49,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 02:07:49,958 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 02:07:49,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 02:07:49,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 02:07:49,958 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 02:07:49,959 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 02:07:49,959 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 02:07:49,959 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 02:07:49,959 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 02:07:50,250 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 02:07:50,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 02:07:50,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 02:07:50,267 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 02:07:50,268 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 02:07:50,268 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--pg.ko-main.cil.out.i [2019-10-15 02:07:50,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec6b08b9/b8ca6ead265e45a9aafe1c8159b00f68/FLAG36f95c887 [2019-10-15 02:07:51,043 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 02:07:51,044 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-10-15 02:07:51,079 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec6b08b9/b8ca6ead265e45a9aafe1c8159b00f68/FLAG36f95c887 [2019-10-15 02:07:51,161 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ec6b08b9/b8ca6ead265e45a9aafe1c8159b00f68 [2019-10-15 02:07:51,169 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 02:07:51,170 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 02:07:51,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 02:07:51,172 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 02:07:51,175 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 02:07:51,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:07:51" (1/1) ... [2019-10-15 02:07:51,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b204826 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:51, skipping insertion in model container [2019-10-15 02:07:51,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 02:07:51" (1/1) ... [2019-10-15 02:07:51,186 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 02:07:51,283 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 02:07:52,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:07:52,559 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 02:07:52,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 02:07:52,842 INFO L192 MainTranslator]: Completed translation [2019-10-15 02:07:52,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:52 WrapperNode [2019-10-15 02:07:52,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 02:07:52,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 02:07:52,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 02:07:52,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 02:07:52,867 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:52" (1/1) ... [2019-10-15 02:07:52,868 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:52" (1/1) ... [2019-10-15 02:07:52,961 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:52" (1/1) ... [2019-10-15 02:07:52,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:52" (1/1) ... [2019-10-15 02:07:53,075 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:52" (1/1) ... [2019-10-15 02:07:53,100 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:52" (1/1) ... [2019-10-15 02:07:53,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:52" (1/1) ... [2019-10-15 02:07:53,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 02:07:53,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 02:07:53,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 02:07:53,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 02:07:53,175 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 02:07:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 02:07:53,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 02:07:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-10-15 02:07:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-15 02:07:53,281 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-15 02:07:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-15 02:07:53,283 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-10-15 02:07:53,284 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-10-15 02:07:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-10-15 02:07:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-15 02:07:53,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-15 02:07:53,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-15 02:07:53,286 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-15 02:07:53,287 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-10-15 02:07:53,287 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-10-15 02:07:53,287 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init_units [2019-10-15 02:07:53,290 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-10-15 02:07:53,290 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-10-15 02:07:53,290 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-10-15 02:07:53,291 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-10-15 02:07:53,291 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2019-10-15 02:07:53,291 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2019-10-15 02:07:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2019-10-15 02:07:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2019-10-15 02:07:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2019-10-15 02:07:53,293 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-10-15 02:07:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2019-10-15 02:07:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2019-10-15 02:07:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_detect [2019-10-15 02:07:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_open [2019-10-15 02:07:53,294 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_release [2019-10-15 02:07:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2019-10-15 02:07:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_read [2019-10-15 02:07:53,295 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init [2019-10-15 02:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_exit [2019-10-15 02:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 02:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-10-15 02:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-10-15 02:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-10-15 02:07:53,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-10-15 02:07:53,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-10-15 02:07:53,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-10-15 02:07:53,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-10-15 02:07:53,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-10-15 02:07:53,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-15 02:07:53,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_10 [2019-10-15 02:07:53,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_11 [2019-10-15 02:07:53,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-15 02:07:53,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-15 02:07:53,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-15 02:07:53,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-15 02:07:53,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-15 02:07:53,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-15 02:07:53,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-15 02:07:53,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-15 02:07:53,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-15 02:07:53,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-15 02:07:53,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-15 02:07:53,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-15 02:07:53,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-15 02:07:53,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-15 02:07:53,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-15 02:07:53,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-15 02:07:53,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-15 02:07:53,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-10-15 02:07:53,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_pg_mutex [2019-10-15 02:07:53,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pg_mutex [2019-10-15 02:07:53,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_pg_mutex [2019-10-15 02:07:53,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-10-15 02:07:53,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_pg_mutex [2019-10-15 02:07:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pg_mutex [2019-10-15 02:07:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-15 02:07:53,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-15 02:07:53,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-10-15 02:07:53,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-10-15 02:07:53,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-10-15 02:07:53,309 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-10-15 02:07:53,310 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-10-15 02:07:53,310 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-10-15 02:07:53,310 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-10-15 02:07:53,311 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-10-15 02:07:53,311 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-10-15 02:07:53,312 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-15 02:07:53,312 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-15 02:07:53,312 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-15 02:07:53,312 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-15 02:07:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-10-15 02:07:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-10-15 02:07:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-10-15 02:07:53,313 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-10-15 02:07:53,314 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-10-15 02:07:53,314 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-10-15 02:07:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-10-15 02:07:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-10-15 02:07:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-10-15 02:07:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-15 02:07:53,315 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-10-15 02:07:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-10-15 02:07:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-15 02:07:53,316 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-15 02:07:53,317 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-15 02:07:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 02:07:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 02:07:53,317 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-15 02:07:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-10-15 02:07:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-15 02:07:53,318 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-15 02:07:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-15 02:07:53,319 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-15 02:07:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-15 02:07:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-10-15 02:07:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-10-15 02:07:53,320 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-15 02:07:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-15 02:07:53,321 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-15 02:07:53,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-10-15 02:07:53,322 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-15 02:07:53,323 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-10-15 02:07:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-10-15 02:07:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-10-15 02:07:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-15 02:07:53,324 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-15 02:07:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-10-15 02:07:53,325 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-10-15 02:07:53,326 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-10-15 02:07:53,326 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-10-15 02:07:53,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-15 02:07:53,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-15 02:07:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-15 02:07:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-15 02:07:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-15 02:07:53,378 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pg_mutex [2019-10-15 02:07:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pg_mutex [2019-10-15 02:07:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 02:07:53,379 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-10-15 02:07:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 02:07:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-10-15 02:07:53,381 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-10-15 02:07:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-10-15 02:07:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_10 [2019-10-15 02:07:53,382 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-10-15 02:07:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_11 [2019-10-15 02:07:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-10-15 02:07:53,383 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-10-15 02:07:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-15 02:07:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 02:07:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 02:07:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-15 02:07:53,384 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-15 02:07:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 02:07:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-15 02:07:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-15 02:07:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-10-15 02:07:53,385 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-10-15 02:07:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-10-15 02:07:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-10-15 02:07:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-10-15 02:07:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-10-15 02:07:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-10-15 02:07:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-10-15 02:07:53,386 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-10-15 02:07:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-10-15 02:07:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-10-15 02:07:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-10-15 02:07:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-10-15 02:07:53,387 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-10-15 02:07:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-10-15 02:07:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-10-15 02:07:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-10-15 02:07:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure pg_open [2019-10-15 02:07:53,388 INFO L130 BoogieDeclarations]: Found specification of procedure pg_release [2019-10-15 02:07:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure pg_read [2019-10-15 02:07:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2019-10-15 02:07:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure pg_detect [2019-10-15 02:07:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2019-10-15 02:07:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init_units [2019-10-15 02:07:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 02:07:53,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 02:07:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 02:07:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-10-15 02:07:53,390 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-10-15 02:07:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-10-15 02:07:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-10-15 02:07:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2019-10-15 02:07:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2019-10-15 02:07:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2019-10-15 02:07:53,391 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2019-10-15 02:07:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2019-10-15 02:07:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 02:07:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-10-15 02:07:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2019-10-15 02:07:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-15 02:07:53,392 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init [2019-10-15 02:07:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure pg_exit [2019-10-15 02:07:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-15 02:07:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-15 02:07:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 02:07:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-15 02:07:53,393 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-15 02:07:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-15 02:07:53,394 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-15 02:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-15 02:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-15 02:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-15 02:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-15 02:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-15 02:07:53,395 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-15 02:07:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-15 02:07:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-15 02:07:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-10-15 02:07:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_pg_mutex [2019-10-15 02:07:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_pg_mutex [2019-10-15 02:07:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-10-15 02:07:53,396 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_pg_mutex [2019-10-15 02:07:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-15 02:07:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-15 02:07:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-15 02:07:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-15 02:07:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 02:07:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 02:07:53,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 02:07:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-15 02:07:53,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 02:07:57,620 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 02:07:57,621 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 02:07:57,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:07:57 BoogieIcfgContainer [2019-10-15 02:07:57,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 02:07:57,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 02:07:57,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 02:07:57,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 02:07:57,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 02:07:51" (1/3) ... [2019-10-15 02:07:57,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bf922a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:07:57, skipping insertion in model container [2019-10-15 02:07:57,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 02:07:52" (2/3) ... [2019-10-15 02:07:57,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41bf922a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:07:57, skipping insertion in model container [2019-10-15 02:07:57,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:07:57" (3/3) ... [2019-10-15 02:07:57,630 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-10-15 02:07:57,640 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 02:07:57,651 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 02:07:57,663 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 02:07:57,695 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 02:07:57,696 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 02:07:57,696 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 02:07:57,696 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 02:07:57,696 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 02:07:57,696 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 02:07:57,696 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 02:07:57,697 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 02:07:57,725 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states. [2019-10-15 02:07:57,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 02:07:57,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:07:57,735 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:07:57,737 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:07:57,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:07:57,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1809528212, now seen corresponding path program 1 times [2019-10-15 02:07:57,752 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:07:57,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668165676] [2019-10-15 02:07:57,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:07:57,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:07:57,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:07:58,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:07:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:07:58,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668165676] [2019-10-15 02:07:58,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:07:58,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 02:07:58,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213074266] [2019-10-15 02:07:58,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 02:07:58,273 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:07:58,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 02:07:58,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 02:07:58,290 INFO L87 Difference]: Start difference. First operand 552 states. Second operand 4 states. [2019-10-15 02:07:59,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:07:59,185 INFO L93 Difference]: Finished difference Result 958 states and 1262 transitions. [2019-10-15 02:07:59,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:07:59,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-15 02:07:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:07:59,209 INFO L225 Difference]: With dead ends: 958 [2019-10-15 02:07:59,209 INFO L226 Difference]: Without dead ends: 477 [2019-10-15 02:07:59,217 INFO L600 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-15 02:07:59,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-15 02:07:59,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-10-15 02:07:59,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-15 02:07:59,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 618 transitions. [2019-10-15 02:07:59,308 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 618 transitions. Word has length 27 [2019-10-15 02:07:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:07:59,309 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 618 transitions. [2019-10-15 02:07:59,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 02:07:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 618 transitions. [2019-10-15 02:07:59,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-15 02:07:59,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:07:59,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:07:59,312 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:07:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:07:59,313 INFO L82 PathProgramCache]: Analyzing trace with hash -196163103, now seen corresponding path program 1 times [2019-10-15 02:07:59,313 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:07:59,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109652771] [2019-10-15 02:07:59,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:07:59,313 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:07:59,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:07:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:07:59,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:07:59,510 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109652771] [2019-10-15 02:07:59,510 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:07:59,510 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:07:59,511 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263213373] [2019-10-15 02:07:59,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:07:59,512 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:07:59,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:07:59,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:07:59,513 INFO L87 Difference]: Start difference. First operand 477 states and 618 transitions. Second operand 3 states. [2019-10-15 02:07:59,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:07:59,678 INFO L93 Difference]: Finished difference Result 1202 states and 1566 transitions. [2019-10-15 02:07:59,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:07:59,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-15 02:07:59,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:07:59,692 INFO L225 Difference]: With dead ends: 1202 [2019-10-15 02:07:59,692 INFO L226 Difference]: Without dead ends: 734 [2019-10-15 02:07:59,710 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:07:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-15 02:07:59,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 692. [2019-10-15 02:07:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-10-15 02:07:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 907 transitions. [2019-10-15 02:07:59,796 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 907 transitions. Word has length 31 [2019-10-15 02:07:59,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:07:59,796 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 907 transitions. [2019-10-15 02:07:59,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:07:59,797 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 907 transitions. [2019-10-15 02:07:59,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-15 02:07:59,799 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:07:59,799 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:07:59,799 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:07:59,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:07:59,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1571763004, now seen corresponding path program 1 times [2019-10-15 02:07:59,800 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:07:59,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809604958] [2019-10-15 02:07:59,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:07:59,801 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:07:59,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:07:59,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:07:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:07:59,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809604958] [2019-10-15 02:07:59,965 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:07:59,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:07:59,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663608188] [2019-10-15 02:07:59,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:07:59,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:07:59,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:07:59,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:07:59,967 INFO L87 Difference]: Start difference. First operand 692 states and 907 transitions. Second operand 3 states. [2019-10-15 02:08:00,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:00,033 INFO L93 Difference]: Finished difference Result 1381 states and 1821 transitions. [2019-10-15 02:08:00,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:08:00,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-15 02:08:00,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:00,039 INFO L225 Difference]: With dead ends: 1381 [2019-10-15 02:08:00,039 INFO L226 Difference]: Without dead ends: 698 [2019-10-15 02:08:00,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:00,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-15 02:08:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 694. [2019-10-15 02:08:00,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-15 02:08:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 909 transitions. [2019-10-15 02:08:00,080 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 909 transitions. Word has length 38 [2019-10-15 02:08:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:00,081 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 909 transitions. [2019-10-15 02:08:00,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:08:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 909 transitions. [2019-10-15 02:08:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-15 02:08:00,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:00,083 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:08:00,083 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1304531917, now seen corresponding path program 1 times [2019-10-15 02:08:00,084 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:00,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289334779] [2019-10-15 02:08:00,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:00,084 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:00,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 02:08:00,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289334779] [2019-10-15 02:08:00,188 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:00,188 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:08:00,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379491499] [2019-10-15 02:08:00,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:08:00,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:00,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:08:00,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:00,189 INFO L87 Difference]: Start difference. First operand 694 states and 909 transitions. Second operand 3 states. [2019-10-15 02:08:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:00,384 INFO L93 Difference]: Finished difference Result 1548 states and 2025 transitions. [2019-10-15 02:08:00,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:08:00,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-15 02:08:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:00,391 INFO L225 Difference]: With dead ends: 1548 [2019-10-15 02:08:00,391 INFO L226 Difference]: Without dead ends: 863 [2019-10-15 02:08:00,394 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-10-15 02:08:00,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-10-15 02:08:00,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-10-15 02:08:00,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1122 transitions. [2019-10-15 02:08:00,445 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1122 transitions. Word has length 40 [2019-10-15 02:08:00,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:00,446 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1122 transitions. [2019-10-15 02:08:00,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:08:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1122 transitions. [2019-10-15 02:08:00,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 02:08:00,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:00,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:08:00,450 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:00,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:00,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1084538513, now seen corresponding path program 1 times [2019-10-15 02:08:00,451 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:00,451 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185572798] [2019-10-15 02:08:00,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:00,451 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:00,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:00,620 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-15 02:08:00,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185572798] [2019-10-15 02:08:00,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:00,622 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:08:00,622 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551466288] [2019-10-15 02:08:00,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:08:00,623 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:00,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:08:00,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:00,624 INFO L87 Difference]: Start difference. First operand 863 states and 1122 transitions. Second operand 3 states. [2019-10-15 02:08:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:00,907 INFO L93 Difference]: Finished difference Result 865 states and 1123 transitions. [2019-10-15 02:08:00,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:08:00,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 02:08:00,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:00,913 INFO L225 Difference]: With dead ends: 865 [2019-10-15 02:08:00,913 INFO L226 Difference]: Without dead ends: 862 [2019-10-15 02:08:00,914 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:00,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-10-15 02:08:00,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2019-10-15 02:08:00,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-10-15 02:08:00,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1120 transitions. [2019-10-15 02:08:00,971 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1120 transitions. Word has length 43 [2019-10-15 02:08:00,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:00,971 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1120 transitions. [2019-10-15 02:08:00,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:08:00,971 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1120 transitions. [2019-10-15 02:08:00,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-15 02:08:00,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:00,976 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:08:00,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:00,977 INFO L82 PathProgramCache]: Analyzing trace with hash 738650742, now seen corresponding path program 1 times [2019-10-15 02:08:00,977 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:00,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24871582] [2019-10-15 02:08:00,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:00,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:00,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:01,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:01,130 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-15 02:08:01,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24871582] [2019-10-15 02:08:01,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:01,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:08:01,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709409727] [2019-10-15 02:08:01,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:08:01,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:01,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:08:01,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:01,133 INFO L87 Difference]: Start difference. First operand 862 states and 1120 transitions. Second operand 3 states. [2019-10-15 02:08:01,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:01,358 INFO L93 Difference]: Finished difference Result 864 states and 1121 transitions. [2019-10-15 02:08:01,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:08:01,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-15 02:08:01,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:01,366 INFO L225 Difference]: With dead ends: 864 [2019-10-15 02:08:01,366 INFO L226 Difference]: Without dead ends: 861 [2019-10-15 02:08:01,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:01,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-10-15 02:08:01,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2019-10-15 02:08:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-10-15 02:08:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1118 transitions. [2019-10-15 02:08:01,423 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1118 transitions. Word has length 44 [2019-10-15 02:08:01,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:01,424 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1118 transitions. [2019-10-15 02:08:01,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:08:01,424 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1118 transitions. [2019-10-15 02:08:01,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 02:08:01,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:01,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:08:01,426 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:01,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:01,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1422947666, now seen corresponding path program 1 times [2019-10-15 02:08:01,427 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:01,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807004585] [2019-10-15 02:08:01,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:01,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:01,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:01,542 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-15 02:08:01,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807004585] [2019-10-15 02:08:01,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:01,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:08:01,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581560015] [2019-10-15 02:08:01,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:08:01,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:01,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:08:01,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:01,544 INFO L87 Difference]: Start difference. First operand 861 states and 1118 transitions. Second operand 3 states. [2019-10-15 02:08:01,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:01,746 INFO L93 Difference]: Finished difference Result 863 states and 1119 transitions. [2019-10-15 02:08:01,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:08:01,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-15 02:08:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:01,754 INFO L225 Difference]: With dead ends: 863 [2019-10-15 02:08:01,754 INFO L226 Difference]: Without dead ends: 860 [2019-10-15 02:08:01,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:01,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-15 02:08:01,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 860. [2019-10-15 02:08:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-10-15 02:08:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1116 transitions. [2019-10-15 02:08:01,811 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1116 transitions. Word has length 45 [2019-10-15 02:08:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:01,811 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1116 transitions. [2019-10-15 02:08:01,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:08:01,812 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1116 transitions. [2019-10-15 02:08:01,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-15 02:08:01,813 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:01,813 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:08:01,813 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:01,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:01,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1161320697, now seen corresponding path program 1 times [2019-10-15 02:08:01,814 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:01,814 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680864449] [2019-10-15 02:08:01,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:01,814 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:01,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:01,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:01,908 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-15 02:08:01,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680864449] [2019-10-15 02:08:01,908 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:01,908 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:08:01,909 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060297968] [2019-10-15 02:08:01,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:08:01,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:08:01,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:01,910 INFO L87 Difference]: Start difference. First operand 860 states and 1116 transitions. Second operand 3 states. [2019-10-15 02:08:02,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:02,086 INFO L93 Difference]: Finished difference Result 991 states and 1283 transitions. [2019-10-15 02:08:02,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:08:02,086 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-15 02:08:02,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:02,092 INFO L225 Difference]: With dead ends: 991 [2019-10-15 02:08:02,093 INFO L226 Difference]: Without dead ends: 950 [2019-10-15 02:08:02,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-10-15 02:08:02,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-10-15 02:08:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-10-15 02:08:02,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1234 transitions. [2019-10-15 02:08:02,149 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1234 transitions. Word has length 46 [2019-10-15 02:08:02,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:02,150 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1234 transitions. [2019-10-15 02:08:02,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:08:02,150 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1234 transitions. [2019-10-15 02:08:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-15 02:08:02,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:02,153 INFO L380 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] [2019-10-15 02:08:02,153 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1346056143, now seen corresponding path program 1 times [2019-10-15 02:08:02,154 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:02,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82885925] [2019-10-15 02:08:02,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:02,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:02,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:02,313 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-15 02:08:02,313 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82885925] [2019-10-15 02:08:02,314 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:02,314 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 02:08:02,314 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815034894] [2019-10-15 02:08:02,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 02:08:02,315 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:02,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 02:08:02,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 02:08:02,315 INFO L87 Difference]: Start difference. First operand 950 states and 1234 transitions. Second operand 6 states. [2019-10-15 02:08:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:02,421 INFO L93 Difference]: Finished difference Result 1916 states and 2500 transitions. [2019-10-15 02:08:02,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 02:08:02,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-10-15 02:08:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:02,428 INFO L225 Difference]: With dead ends: 1916 [2019-10-15 02:08:02,428 INFO L226 Difference]: Without dead ends: 984 [2019-10-15 02:08:02,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-15 02:08:02,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-10-15 02:08:02,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2019-10-15 02:08:02,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-10-15 02:08:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1282 transitions. [2019-10-15 02:08:02,501 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1282 transitions. Word has length 89 [2019-10-15 02:08:02,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:02,501 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1282 transitions. [2019-10-15 02:08:02,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 02:08:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1282 transitions. [2019-10-15 02:08:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-15 02:08:02,505 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:02,505 INFO L380 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, 1, 1, 1, 1] [2019-10-15 02:08:02,505 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:02,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:02,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1383285675, now seen corresponding path program 1 times [2019-10-15 02:08:02,506 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:02,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951365114] [2019-10-15 02:08:02,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:02,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:02,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:02,704 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-15 02:08:02,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951365114] [2019-10-15 02:08:02,705 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:02,705 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 02:08:02,705 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330911991] [2019-10-15 02:08:02,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 02:08:02,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:02,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 02:08:02,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 02:08:02,707 INFO L87 Difference]: Start difference. First operand 984 states and 1282 transitions. Second operand 4 states. [2019-10-15 02:08:03,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:03,634 INFO L93 Difference]: Finished difference Result 1956 states and 2568 transitions. [2019-10-15 02:08:03,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 02:08:03,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-15 02:08:03,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:03,644 INFO L225 Difference]: With dead ends: 1956 [2019-10-15 02:08:03,645 INFO L226 Difference]: Without dead ends: 990 [2019-10-15 02:08:03,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:08:03,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-10-15 02:08:03,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2019-10-15 02:08:03,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-10-15 02:08:03,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1286 transitions. [2019-10-15 02:08:03,750 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1286 transitions. Word has length 104 [2019-10-15 02:08:03,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:03,750 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 1286 transitions. [2019-10-15 02:08:03,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 02:08:03,751 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1286 transitions. [2019-10-15 02:08:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 02:08:03,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:03,765 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 02:08:03,765 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:03,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash 400440286, now seen corresponding path program 1 times [2019-10-15 02:08:03,766 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:03,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262713336] [2019-10-15 02:08:03,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:03,767 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:03,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:03,998 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 02:08:03,999 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262713336] [2019-10-15 02:08:03,999 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:03,999 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 02:08:03,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642354117] [2019-10-15 02:08:04,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 02:08:04,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:04,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 02:08:04,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 02:08:04,001 INFO L87 Difference]: Start difference. First operand 988 states and 1286 transitions. Second operand 4 states. [2019-10-15 02:08:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:04,108 INFO L93 Difference]: Finished difference Result 2026 states and 2681 transitions. [2019-10-15 02:08:04,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 02:08:04,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-15 02:08:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:04,115 INFO L225 Difference]: With dead ends: 2026 [2019-10-15 02:08:04,115 INFO L226 Difference]: Without dead ends: 1056 [2019-10-15 02:08:04,119 INFO L600 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-15 02:08:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-10-15 02:08:04,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 996. [2019-10-15 02:08:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-10-15 02:08:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1294 transitions. [2019-10-15 02:08:04,178 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1294 transitions. Word has length 147 [2019-10-15 02:08:04,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:04,178 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1294 transitions. [2019-10-15 02:08:04,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 02:08:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1294 transitions. [2019-10-15 02:08:04,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 02:08:04,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:04,184 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 02:08:04,184 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:04,184 INFO L82 PathProgramCache]: Analyzing trace with hash 412473398, now seen corresponding path program 1 times [2019-10-15 02:08:04,185 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:04,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017936672] [2019-10-15 02:08:04,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:04,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:04,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-15 02:08:04,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017936672] [2019-10-15 02:08:04,400 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:04,400 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 02:08:04,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923203493] [2019-10-15 02:08:04,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 02:08:04,401 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:04,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 02:08:04,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:04,402 INFO L87 Difference]: Start difference. First operand 996 states and 1294 transitions. Second operand 3 states. [2019-10-15 02:08:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:04,491 INFO L93 Difference]: Finished difference Result 1990 states and 2619 transitions. [2019-10-15 02:08:04,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 02:08:04,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-15 02:08:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:04,499 INFO L225 Difference]: With dead ends: 1990 [2019-10-15 02:08:04,499 INFO L226 Difference]: Without dead ends: 1012 [2019-10-15 02:08:04,504 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 02:08:04,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-10-15 02:08:04,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1004. [2019-10-15 02:08:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-10-15 02:08:04,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1302 transitions. [2019-10-15 02:08:04,580 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1302 transitions. Word has length 156 [2019-10-15 02:08:04,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:04,582 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1302 transitions. [2019-10-15 02:08:04,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 02:08:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1302 transitions. [2019-10-15 02:08:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-15 02:08:04,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:04,588 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 02:08:04,588 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:04,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1369600157, now seen corresponding path program 1 times [2019-10-15 02:08:04,589 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:04,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545235792] [2019-10-15 02:08:04,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:04,590 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:04,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-15 02:08:04,796 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545235792] [2019-10-15 02:08:04,796 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:04,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 02:08:04,797 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652257940] [2019-10-15 02:08:04,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 02:08:04,798 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:04,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 02:08:04,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:08:04,799 INFO L87 Difference]: Start difference. First operand 1004 states and 1302 transitions. Second operand 5 states. [2019-10-15 02:08:04,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:04,887 INFO L93 Difference]: Finished difference Result 2006 states and 2612 transitions. [2019-10-15 02:08:04,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 02:08:04,888 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-15 02:08:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:04,895 INFO L225 Difference]: With dead ends: 2006 [2019-10-15 02:08:04,895 INFO L226 Difference]: Without dead ends: 1020 [2019-10-15 02:08:04,899 INFO L600 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-15 02:08:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-10-15 02:08:04,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1012. [2019-10-15 02:08:04,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-10-15 02:08:04,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1314 transitions. [2019-10-15 02:08:04,958 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1314 transitions. Word has length 165 [2019-10-15 02:08:04,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:04,959 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1314 transitions. [2019-10-15 02:08:04,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 02:08:04,959 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1314 transitions. [2019-10-15 02:08:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-15 02:08:04,963 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:04,963 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-15 02:08:04,964 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash 915393057, now seen corresponding path program 1 times [2019-10-15 02:08:04,964 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:04,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355499702] [2019-10-15 02:08:04,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:04,969 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:04,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-15 02:08:05,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355499702] [2019-10-15 02:08:05,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:05,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 02:08:05,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303382226] [2019-10-15 02:08:05,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 02:08:05,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:05,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 02:08:05,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:08:05,152 INFO L87 Difference]: Start difference. First operand 1012 states and 1314 transitions. Second operand 5 states. [2019-10-15 02:08:05,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:05,257 INFO L93 Difference]: Finished difference Result 2066 states and 2704 transitions. [2019-10-15 02:08:05,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 02:08:05,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-10-15 02:08:05,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:05,265 INFO L225 Difference]: With dead ends: 2066 [2019-10-15 02:08:05,265 INFO L226 Difference]: Without dead ends: 1072 [2019-10-15 02:08:05,271 INFO L600 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-15 02:08:05,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-10-15 02:08:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1020. [2019-10-15 02:08:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-15 02:08:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1322 transitions. [2019-10-15 02:08:05,419 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1322 transitions. Word has length 174 [2019-10-15 02:08:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:05,420 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1322 transitions. [2019-10-15 02:08:05,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 02:08:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1322 transitions. [2019-10-15 02:08:05,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-15 02:08:05,427 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:05,428 INFO L380 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] [2019-10-15 02:08:05,428 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:05,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:05,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1842701031, now seen corresponding path program 1 times [2019-10-15 02:08:05,429 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:05,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181291283] [2019-10-15 02:08:05,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:05,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:05,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:05,732 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-15 02:08:05,732 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181291283] [2019-10-15 02:08:05,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:05,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 02:08:05,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353000727] [2019-10-15 02:08:05,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 02:08:05,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:05,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 02:08:05,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 02:08:05,735 INFO L87 Difference]: Start difference. First operand 1020 states and 1322 transitions. Second operand 5 states. [2019-10-15 02:08:05,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:05,842 INFO L93 Difference]: Finished difference Result 2058 states and 2706 transitions. [2019-10-15 02:08:05,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 02:08:05,843 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-10-15 02:08:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:05,853 INFO L225 Difference]: With dead ends: 2058 [2019-10-15 02:08:05,853 INFO L226 Difference]: Without dead ends: 1056 [2019-10-15 02:08:05,862 INFO L600 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-15 02:08:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-10-15 02:08:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1036. [2019-10-15 02:08:05,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-10-15 02:08:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1350 transitions. [2019-10-15 02:08:05,965 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1350 transitions. Word has length 211 [2019-10-15 02:08:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:05,966 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1350 transitions. [2019-10-15 02:08:05,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 02:08:05,966 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1350 transitions. [2019-10-15 02:08:05,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-15 02:08:05,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:05,976 INFO L380 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-15 02:08:05,977 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1044559062, now seen corresponding path program 1 times [2019-10-15 02:08:05,978 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:05,978 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032053796] [2019-10-15 02:08:05,978 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:05,979 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:05,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:06,394 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-15 02:08:06,395 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032053796] [2019-10-15 02:08:06,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:06,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 02:08:06,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767268122] [2019-10-15 02:08:06,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 02:08:06,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:06,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 02:08:06,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:08:06,401 INFO L87 Difference]: Start difference. First operand 1036 states and 1350 transitions. Second operand 10 states. [2019-10-15 02:08:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:06,579 INFO L93 Difference]: Finished difference Result 2094 states and 2758 transitions. [2019-10-15 02:08:06,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 02:08:06,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2019-10-15 02:08:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:06,588 INFO L225 Difference]: With dead ends: 2094 [2019-10-15 02:08:06,588 INFO L226 Difference]: Without dead ends: 1076 [2019-10-15 02:08:06,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:08:06,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-10-15 02:08:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1046. [2019-10-15 02:08:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-10-15 02:08:06,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1362 transitions. [2019-10-15 02:08:06,658 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1362 transitions. Word has length 237 [2019-10-15 02:08:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:06,659 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 1362 transitions. [2019-10-15 02:08:06,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 02:08:06,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1362 transitions. [2019-10-15 02:08:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-15 02:08:06,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:06,664 INFO L380 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] [2019-10-15 02:08:06,664 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:06,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:06,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1402068112, now seen corresponding path program 1 times [2019-10-15 02:08:06,665 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:06,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915334883] [2019-10-15 02:08:06,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:06,665 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:06,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:06,984 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-15 02:08:06,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915334883] [2019-10-15 02:08:06,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:06,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 02:08:06,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608385029] [2019-10-15 02:08:06,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 02:08:06,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:06,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 02:08:06,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:08:06,987 INFO L87 Difference]: Start difference. First operand 1046 states and 1362 transitions. Second operand 10 states. [2019-10-15 02:08:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:07,126 INFO L93 Difference]: Finished difference Result 2114 states and 2758 transitions. [2019-10-15 02:08:07,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 02:08:07,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 235 [2019-10-15 02:08:07,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:07,134 INFO L225 Difference]: With dead ends: 2114 [2019-10-15 02:08:07,134 INFO L226 Difference]: Without dead ends: 1086 [2019-10-15 02:08:07,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:08:07,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-10-15 02:08:07,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1048. [2019-10-15 02:08:07,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-15 02:08:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1364 transitions. [2019-10-15 02:08:07,203 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1364 transitions. Word has length 235 [2019-10-15 02:08:07,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:07,205 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1364 transitions. [2019-10-15 02:08:07,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 02:08:07,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1364 transitions. [2019-10-15 02:08:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-15 02:08:07,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:07,210 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:08:07,210 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:07,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:07,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1309145940, now seen corresponding path program 1 times [2019-10-15 02:08:07,211 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:07,211 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861585692] [2019-10-15 02:08:07,211 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:07,212 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:07,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:07,512 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-15 02:08:07,513 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861585692] [2019-10-15 02:08:07,513 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:07,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 02:08:07,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434338762] [2019-10-15 02:08:07,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 02:08:07,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:07,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 02:08:07,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:08:07,515 INFO L87 Difference]: Start difference. First operand 1048 states and 1364 transitions. Second operand 10 states. [2019-10-15 02:08:07,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:07,680 INFO L93 Difference]: Finished difference Result 2160 states and 2838 transitions. [2019-10-15 02:08:07,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 02:08:07,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 244 [2019-10-15 02:08:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:07,733 INFO L225 Difference]: With dead ends: 2160 [2019-10-15 02:08:07,734 INFO L226 Difference]: Without dead ends: 1130 [2019-10-15 02:08:07,738 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 02:08:07,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-10-15 02:08:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1048. [2019-10-15 02:08:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-15 02:08:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1364 transitions. [2019-10-15 02:08:07,811 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1364 transitions. Word has length 244 [2019-10-15 02:08:07,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:07,812 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1364 transitions. [2019-10-15 02:08:07,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 02:08:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1364 transitions. [2019-10-15 02:08:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-15 02:08:07,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:07,817 INFO L380 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:08:07,817 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:07,817 INFO L82 PathProgramCache]: Analyzing trace with hash 822307866, now seen corresponding path program 1 times [2019-10-15 02:08:07,817 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:07,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844764287] [2019-10-15 02:08:07,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:07,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:07,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-15 02:08:08,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844764287] [2019-10-15 02:08:08,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 02:08:08,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 02:08:08,119 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197291803] [2019-10-15 02:08:08,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 02:08:08,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:08,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 02:08:08,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:08:08,123 INFO L87 Difference]: Start difference. First operand 1048 states and 1364 transitions. Second operand 10 states. [2019-10-15 02:08:08,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:08,292 INFO L93 Difference]: Finished difference Result 2172 states and 2850 transitions. [2019-10-15 02:08:08,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 02:08:08,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 246 [2019-10-15 02:08:08,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:08,304 INFO L225 Difference]: With dead ends: 2172 [2019-10-15 02:08:08,304 INFO L226 Difference]: Without dead ends: 1142 [2019-10-15 02:08:08,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 02:08:08,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-10-15 02:08:08,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1044. [2019-10-15 02:08:08,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2019-10-15 02:08:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1356 transitions. [2019-10-15 02:08:08,404 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1356 transitions. Word has length 246 [2019-10-15 02:08:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:08,405 INFO L462 AbstractCegarLoop]: Abstraction has 1044 states and 1356 transitions. [2019-10-15 02:08:08,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 02:08:08,406 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1356 transitions. [2019-10-15 02:08:08,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-15 02:08:08,419 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:08,419 INFO L380 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:08:08,420 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:08,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:08,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1872541421, now seen corresponding path program 1 times [2019-10-15 02:08:08,421 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:08,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065066883] [2019-10-15 02:08:08,421 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:08,422 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:08,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-10-15 02:08:08,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065066883] [2019-10-15 02:08:08,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789240630] [2019-10-15 02:08:08,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:08:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:09,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 2898 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 02:08:09,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:08:10,070 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-15 02:08:10,071 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:08:10,874 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-10-15 02:08:10,875 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 02:08:10,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-15 02:08:10,875 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257864588] [2019-10-15 02:08:10,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 02:08:10,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 02:08:10,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 02:08:10,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:08:10,877 INFO L87 Difference]: Start difference. First operand 1044 states and 1356 transitions. Second operand 4 states. [2019-10-15 02:08:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 02:08:10,997 INFO L93 Difference]: Finished difference Result 2078 states and 2706 transitions. [2019-10-15 02:08:10,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 02:08:10,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-10-15 02:08:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 02:08:11,006 INFO L225 Difference]: With dead ends: 2078 [2019-10-15 02:08:11,006 INFO L226 Difference]: Without dead ends: 1052 [2019-10-15 02:08:11,010 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-15 02:08:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-15 02:08:11,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-10-15 02:08:11,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-10-15 02:08:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1366 transitions. [2019-10-15 02:08:11,199 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1366 transitions. Word has length 270 [2019-10-15 02:08:11,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 02:08:11,200 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1366 transitions. [2019-10-15 02:08:11,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 02:08:11,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1366 transitions. [2019-10-15 02:08:11,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-15 02:08:11,210 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 02:08:11,211 INFO L380 BasicCegarLoop]: trace histogram [8, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 02:08:11,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:08:11,423 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 02:08:11,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 02:08:11,424 INFO L82 PathProgramCache]: Analyzing trace with hash 175399987, now seen corresponding path program 1 times [2019-10-15 02:08:11,424 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 02:08:11,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498483809] [2019-10-15 02:08:11,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:11,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 02:08:11,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 02:08:11,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:11,752 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-15 02:08:11,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498483809] [2019-10-15 02:08:11,752 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65803819] [2019-10-15 02:08:11,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 02:08:12,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 02:08:12,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 2920 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 02:08:12,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 02:08:12,845 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-15 02:08:12,845 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 02:08:13,623 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-15 02:08:13,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [813778729] [2019-10-15 02:08:13,667 INFO L162 IcfgInterpreter]: Started Sifa with 204 locations of interest [2019-10-15 02:08:13,668 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 02:08:13,675 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 02:08:13,682 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 02:08:13,683 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs