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-f4eb214f-m [2019-10-13 22:05:24,165 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:05:24,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:05:24,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:05:24,186 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:05:24,187 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:05:24,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:05:24,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:05:24,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:05:24,193 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:05:24,194 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:05:24,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:05:24,196 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:05:24,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:05:24,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:05:24,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:05:24,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:05:24,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:05:24,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:05:24,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:05:24,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:05:24,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:05:24,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:05:24,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:05:24,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:05:24,212 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:05:24,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:05:24,213 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:05:24,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:05:24,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:05:24,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:05:24,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:05:24,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:05:24,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:05:24,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:05:24,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:05:24,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:05:24,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:05:24,223 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:05:24,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:05:24,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:05:24,230 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-13 22:05:24,253 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:05:24,253 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:05:24,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:05:24,256 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:05:24,256 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:05:24,256 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:05:24,256 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:05:24,257 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:05:24,257 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:05:24,257 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:05:24,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:05:24,258 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:05:24,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:05:24,259 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:05:24,259 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:05:24,259 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:05:24,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:05:24,260 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:05:24,260 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:05:24,260 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:05:24,260 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:05:24,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:05:24,261 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:05:24,261 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:05:24,261 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:05:24,262 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:05:24,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:05:24,262 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:05:24,262 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-13 22:05:24,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:05:24,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:05:24,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:05:24,568 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:05:24,568 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:05:24,569 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-13 22:05:24,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417ea3531/cbb8b802e93a4b228696549276db02ee/FLAG235e56399 [2019-10-13 22:05:25,403 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:05:25,403 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-13 22:05:25,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417ea3531/cbb8b802e93a4b228696549276db02ee/FLAG235e56399 [2019-10-13 22:05:25,490 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/417ea3531/cbb8b802e93a4b228696549276db02ee [2019-10-13 22:05:25,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:05:25,503 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:05:25,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:05:25,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:05:25,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:05:25,509 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:05:25" (1/1) ... [2019-10-13 22:05:25,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29e31cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:25, skipping insertion in model container [2019-10-13 22:05:25,512 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:05:25" (1/1) ... [2019-10-13 22:05:25,520 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:05:25,626 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:05:26,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:05:27,045 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:05:27,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:05:27,386 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:05:27,387 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:27 WrapperNode [2019-10-13 22:05:27,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:05:27,389 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:05:27,390 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:05:27,390 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:05:27,410 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:27" (1/1) ... [2019-10-13 22:05:27,410 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:27" (1/1) ... [2019-10-13 22:05:27,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:27" (1/1) ... [2019-10-13 22:05:27,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:27" (1/1) ... [2019-10-13 22:05:27,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:27" (1/1) ... [2019-10-13 22:05:27,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:27" (1/1) ... [2019-10-13 22:05:27,637 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:27" (1/1) ... [2019-10-13 22:05:27,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:05:27,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:05:27,653 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:05:27,653 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:05:27,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:27" (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-13 22:05:27,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:05:27,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:05:27,729 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-10-13 22:05:27,730 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-13 22:05:27,730 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-13 22:05:27,731 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-13 22:05:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-10-13 22:05:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-10-13 22:05:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-10-13 22:05:27,732 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-13 22:05:27,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-13 22:05:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-13 22:05:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-13 22:05:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-10-13 22:05:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-10-13 22:05:27,734 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init_units [2019-10-13 22:05:27,737 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-10-13 22:05:27,737 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-10-13 22:05:27,737 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-10-13 22:05:27,738 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-10-13 22:05:27,738 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2019-10-13 22:05:27,739 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2019-10-13 22:05:27,740 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2019-10-13 22:05:27,740 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2019-10-13 22:05:27,740 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2019-10-13 22:05:27,740 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-10-13 22:05:27,740 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2019-10-13 22:05:27,740 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2019-10-13 22:05:27,741 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_detect [2019-10-13 22:05:27,741 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_open [2019-10-13 22:05:27,741 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_release [2019-10-13 22:05:27,742 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2019-10-13 22:05:27,742 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_read [2019-10-13 22:05:27,742 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init [2019-10-13 22:05:27,742 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_exit [2019-10-13 22:05:27,742 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:05:27,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-10-13 22:05:27,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-10-13 22:05:27,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-10-13 22:05:27,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-10-13 22:05:27,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-10-13 22:05:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-10-13 22:05:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-10-13 22:05:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-10-13 22:05:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-13 22:05:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_10 [2019-10-13 22:05:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_11 [2019-10-13 22:05:27,744 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-13 22:05:27,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-13 22:05:27,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-13 22:05:27,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,746 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-13 22:05:27,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-13 22:05:27,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-13 22:05:27,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-13 22:05:27,747 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-13 22:05:27,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-13 22:05:27,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-13 22:05:27,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-13 22:05:27,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-13 22:05:27,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-13 22:05:27,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-13 22:05:27,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-13 22:05:27,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-13 22:05:27,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-13 22:05:27,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-10-13 22:05:27,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_pg_mutex [2019-10-13 22:05:27,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pg_mutex [2019-10-13 22:05:27,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_pg_mutex [2019-10-13 22:05:27,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-10-13 22:05:27,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_pg_mutex [2019-10-13 22:05:27,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pg_mutex [2019-10-13 22:05:27,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-13 22:05:27,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-13 22:05:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-10-13 22:05:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-10-13 22:05:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-10-13 22:05:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-10-13 22:05:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-10-13 22:05:27,753 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-10-13 22:05:27,754 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-10-13 22:05:27,754 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-10-13 22:05:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-10-13 22:05:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-13 22:05:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-13 22:05:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-13 22:05:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-13 22:05:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-10-13 22:05:27,755 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-10-13 22:05:27,756 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-10-13 22:05:27,756 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-10-13 22:05:27,756 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-10-13 22:05:27,757 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-10-13 22:05:27,757 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-10-13 22:05:27,757 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-10-13 22:05:27,757 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-10-13 22:05:27,757 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-13 22:05:27,757 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-10-13 22:05:27,757 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-10-13 22:05:27,758 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-13 22:05:27,758 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-13 22:05:27,758 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-13 22:05:27,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 22:05:27,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:05:27,759 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-13 22:05:27,759 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-10-13 22:05:27,759 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-13 22:05:27,759 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-13 22:05:27,759 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-13 22:05:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-13 22:05:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-13 22:05:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-10-13 22:05:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-10-13 22:05:27,760 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-13 22:05:27,761 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-13 22:05:27,761 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-13 22:05:27,761 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-10-13 22:05:27,761 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-13 22:05:27,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-10-13 22:05:27,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-10-13 22:05:27,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-10-13 22:05:27,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-13 22:05:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-13 22:05:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-10-13 22:05:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-10-13 22:05:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-10-13 22:05:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-10-13 22:05:27,824 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-13 22:05:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-13 22:05:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-13 22:05:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-13 22:05:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-13 22:05:27,825 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pg_mutex [2019-10-13 22:05:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pg_mutex [2019-10-13 22:05:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:05:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-10-13 22:05:27,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 22:05:27,827 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-10-13 22:05:27,827 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-10-13 22:05:27,827 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-10-13 22:05:27,827 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_10 [2019-10-13 22:05:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-10-13 22:05:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_11 [2019-10-13 22:05:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-10-13 22:05:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-10-13 22:05:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-13 22:05:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:05:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 22:05:27,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-13 22:05:27,829 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-13 22:05:27,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 22:05:27,829 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-13 22:05:27,829 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-13 22:05:27,830 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-10-13 22:05:27,830 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-10-13 22:05:27,830 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-10-13 22:05:27,830 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-10-13 22:05:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-10-13 22:05:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-10-13 22:05:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-10-13 22:05:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-10-13 22:05:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-10-13 22:05:27,831 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-10-13 22:05:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-10-13 22:05:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-10-13 22:05:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-10-13 22:05:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-10-13 22:05:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-10-13 22:05:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-10-13 22:05:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-10-13 22:05:27,832 INFO L130 BoogieDeclarations]: Found specification of procedure pg_open [2019-10-13 22:05:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure pg_release [2019-10-13 22:05:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure pg_read [2019-10-13 22:05:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2019-10-13 22:05:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure pg_detect [2019-10-13 22:05:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2019-10-13 22:05:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init_units [2019-10-13 22:05:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 22:05:27,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 22:05:27,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 22:05:27,834 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-10-13 22:05:27,834 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-10-13 22:05:27,834 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-10-13 22:05:27,834 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-10-13 22:05:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2019-10-13 22:05:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2019-10-13 22:05:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2019-10-13 22:05:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2019-10-13 22:05:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2019-10-13 22:05:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 22:05:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-10-13 22:05:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2019-10-13 22:05:27,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-13 22:05:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init [2019-10-13 22:05:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure pg_exit [2019-10-13 22:05:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-13 22:05:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-13 22:05:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:05:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-13 22:05:27,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-13 22:05:27,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-13 22:05:27,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-13 22:05:27,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-13 22:05:27,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-13 22:05:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-13 22:05:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-13 22:05:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-13 22:05:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-13 22:05:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-13 22:05:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-13 22:05:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-10-13 22:05:27,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_pg_mutex [2019-10-13 22:05:27,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_pg_mutex [2019-10-13 22:05:27,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-10-13 22:05:27,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_pg_mutex [2019-10-13 22:05:27,839 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-13 22:05:27,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-13 22:05:27,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-13 22:05:27,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-13 22:05:27,839 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 22:05:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:05:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 22:05:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 22:05:27,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:05:32,601 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:05:32,601 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 22:05:32,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:05:32 BoogieIcfgContainer [2019-10-13 22:05:32,603 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:05:32,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:05:32,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:05:32,608 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:05:32,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:05:25" (1/3) ... [2019-10-13 22:05:32,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e41970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:05:32, skipping insertion in model container [2019-10-13 22:05:32,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:05:27" (2/3) ... [2019-10-13 22:05:32,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12e41970 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:05:32, skipping insertion in model container [2019-10-13 22:05:32,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:05:32" (3/3) ... [2019-10-13 22:05:32,612 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-10-13 22:05:32,623 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:05:32,633 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:05:32,645 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:05:32,675 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:05:32,675 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:05:32,675 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:05:32,675 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:05:32,676 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:05:32,676 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:05:32,676 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:05:32,676 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:05:32,706 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states. [2019-10-13 22:05:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 22:05:32,716 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:32,717 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-13 22:05:32,719 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:32,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:32,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1809528212, now seen corresponding path program 1 times [2019-10-13 22:05:32,735 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:32,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744672551] [2019-10-13 22:05:32,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:32,736 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:32,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:33,313 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-13 22:05:33,314 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744672551] [2019-10-13 22:05:33,315 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:33,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:05:33,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281381192] [2019-10-13 22:05:33,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:05:33,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:05:33,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:05:33,344 INFO L87 Difference]: Start difference. First operand 552 states. Second operand 4 states. [2019-10-13 22:05:34,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:34,352 INFO L93 Difference]: Finished difference Result 958 states and 1262 transitions. [2019-10-13 22:05:34,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:05:34,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-10-13 22:05:34,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:34,388 INFO L225 Difference]: With dead ends: 958 [2019-10-13 22:05:34,388 INFO L226 Difference]: Without dead ends: 477 [2019-10-13 22:05:34,400 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-13 22:05:34,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-10-13 22:05:34,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 477. [2019-10-13 22:05:34,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 477 states. [2019-10-13 22:05:34,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 618 transitions. [2019-10-13 22:05:34,499 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 618 transitions. Word has length 27 [2019-10-13 22:05:34,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:34,500 INFO L462 AbstractCegarLoop]: Abstraction has 477 states and 618 transitions. [2019-10-13 22:05:34,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:05:34,500 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 618 transitions. [2019-10-13 22:05:34,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 22:05:34,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:34,506 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-13 22:05:34,506 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash -196163103, now seen corresponding path program 1 times [2019-10-13 22:05:34,507 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:34,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898276835] [2019-10-13 22:05:34,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:34,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:34,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:34,714 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-13 22:05:34,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898276835] [2019-10-13 22:05:34,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:34,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:05:34,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933960421] [2019-10-13 22:05:34,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:05:34,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:34,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:05:34,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:05:34,718 INFO L87 Difference]: Start difference. First operand 477 states and 618 transitions. Second operand 3 states. [2019-10-13 22:05:34,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:34,880 INFO L93 Difference]: Finished difference Result 1202 states and 1566 transitions. [2019-10-13 22:05:34,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:05:34,880 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-13 22:05:34,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:34,889 INFO L225 Difference]: With dead ends: 1202 [2019-10-13 22:05:34,889 INFO L226 Difference]: Without dead ends: 734 [2019-10-13 22:05:34,893 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-13 22:05:34,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2019-10-13 22:05:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 692. [2019-10-13 22:05:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-10-13 22:05:35,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 907 transitions. [2019-10-13 22:05:35,018 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 907 transitions. Word has length 31 [2019-10-13 22:05:35,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:35,020 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 907 transitions. [2019-10-13 22:05:35,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:05:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 907 transitions. [2019-10-13 22:05:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 22:05:35,032 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:35,032 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-13 22:05:35,032 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:35,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:35,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1571763004, now seen corresponding path program 1 times [2019-10-13 22:05:35,033 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:35,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357865038] [2019-10-13 22:05:35,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:35,034 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:35,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:35,268 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-13 22:05:35,269 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357865038] [2019-10-13 22:05:35,269 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:35,269 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:05:35,270 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690555918] [2019-10-13 22:05:35,270 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:05:35,270 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:35,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:05:35,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:05:35,271 INFO L87 Difference]: Start difference. First operand 692 states and 907 transitions. Second operand 3 states. [2019-10-13 22:05:35,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:35,348 INFO L93 Difference]: Finished difference Result 1381 states and 1821 transitions. [2019-10-13 22:05:35,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:05:35,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-10-13 22:05:35,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:35,355 INFO L225 Difference]: With dead ends: 1381 [2019-10-13 22:05:35,356 INFO L226 Difference]: Without dead ends: 698 [2019-10-13 22:05:35,360 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-13 22:05:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2019-10-13 22:05:35,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 694. [2019-10-13 22:05:35,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-10-13 22:05:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 909 transitions. [2019-10-13 22:05:35,419 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 909 transitions. Word has length 38 [2019-10-13 22:05:35,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:35,420 INFO L462 AbstractCegarLoop]: Abstraction has 694 states and 909 transitions. [2019-10-13 22:05:35,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:05:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 909 transitions. [2019-10-13 22:05:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-13 22:05:35,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:35,424 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-13 22:05:35,424 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:35,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1304531917, now seen corresponding path program 1 times [2019-10-13 22:05:35,425 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:35,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674509322] [2019-10-13 22:05:35,425 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:35,427 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:35,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:35,541 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-13 22:05:35,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674509322] [2019-10-13 22:05:35,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:35,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:05:35,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500799007] [2019-10-13 22:05:35,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:05:35,543 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:35,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:05:35,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:05:35,543 INFO L87 Difference]: Start difference. First operand 694 states and 909 transitions. Second operand 3 states. [2019-10-13 22:05:35,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:35,743 INFO L93 Difference]: Finished difference Result 1548 states and 2025 transitions. [2019-10-13 22:05:35,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:05:35,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-13 22:05:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:35,749 INFO L225 Difference]: With dead ends: 1548 [2019-10-13 22:05:35,749 INFO L226 Difference]: Without dead ends: 863 [2019-10-13 22:05:35,753 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-13 22:05:35,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-10-13 22:05:35,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 863. [2019-10-13 22:05:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 863 states. [2019-10-13 22:05:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 863 states to 863 states and 1122 transitions. [2019-10-13 22:05:35,799 INFO L78 Accepts]: Start accepts. Automaton has 863 states and 1122 transitions. Word has length 40 [2019-10-13 22:05:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:35,800 INFO L462 AbstractCegarLoop]: Abstraction has 863 states and 1122 transitions. [2019-10-13 22:05:35,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:05:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 863 states and 1122 transitions. [2019-10-13 22:05:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 22:05:35,801 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:35,801 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-13 22:05:35,802 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:35,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:35,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1084538513, now seen corresponding path program 1 times [2019-10-13 22:05:35,802 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:35,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412664812] [2019-10-13 22:05:35,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:35,803 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:35,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:35,932 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-13 22:05:35,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412664812] [2019-10-13 22:05:35,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:35,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:05:35,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295969149] [2019-10-13 22:05:35,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:05:35,933 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:35,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:05:35,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:05:35,934 INFO L87 Difference]: Start difference. First operand 863 states and 1122 transitions. Second operand 3 states. [2019-10-13 22:05:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:36,225 INFO L93 Difference]: Finished difference Result 865 states and 1123 transitions. [2019-10-13 22:05:36,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:05:36,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-13 22:05:36,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:36,231 INFO L225 Difference]: With dead ends: 865 [2019-10-13 22:05:36,231 INFO L226 Difference]: Without dead ends: 862 [2019-10-13 22:05:36,232 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-13 22:05:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2019-10-13 22:05:36,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2019-10-13 22:05:36,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2019-10-13 22:05:36,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1120 transitions. [2019-10-13 22:05:36,286 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1120 transitions. Word has length 43 [2019-10-13 22:05:36,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:36,287 INFO L462 AbstractCegarLoop]: Abstraction has 862 states and 1120 transitions. [2019-10-13 22:05:36,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:05:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1120 transitions. [2019-10-13 22:05:36,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 22:05:36,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:36,288 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-13 22:05:36,289 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:36,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:36,289 INFO L82 PathProgramCache]: Analyzing trace with hash 738650742, now seen corresponding path program 1 times [2019-10-13 22:05:36,290 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:36,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670745188] [2019-10-13 22:05:36,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:36,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:36,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:36,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:36,407 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-13 22:05:36,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670745188] [2019-10-13 22:05:36,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:36,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:05:36,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106136090] [2019-10-13 22:05:36,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:05:36,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:36,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:05:36,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:05:36,410 INFO L87 Difference]: Start difference. First operand 862 states and 1120 transitions. Second operand 3 states. [2019-10-13 22:05:36,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:36,574 INFO L93 Difference]: Finished difference Result 864 states and 1121 transitions. [2019-10-13 22:05:36,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:05:36,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-13 22:05:36,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:36,581 INFO L225 Difference]: With dead ends: 864 [2019-10-13 22:05:36,581 INFO L226 Difference]: Without dead ends: 861 [2019-10-13 22:05:36,582 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-13 22:05:36,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-10-13 22:05:36,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2019-10-13 22:05:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 861 states. [2019-10-13 22:05:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1118 transitions. [2019-10-13 22:05:36,693 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1118 transitions. Word has length 44 [2019-10-13 22:05:36,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:36,694 INFO L462 AbstractCegarLoop]: Abstraction has 861 states and 1118 transitions. [2019-10-13 22:05:36,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:05:36,694 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1118 transitions. [2019-10-13 22:05:36,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 22:05:36,697 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:36,697 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-13 22:05:36,698 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:36,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:36,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1422947666, now seen corresponding path program 1 times [2019-10-13 22:05:36,699 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:36,699 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106622178] [2019-10-13 22:05:36,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:36,699 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:36,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:36,846 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-13 22:05:36,847 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106622178] [2019-10-13 22:05:36,848 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:36,848 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:05:36,848 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658747423] [2019-10-13 22:05:36,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:05:36,849 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:36,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:05:36,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:05:36,852 INFO L87 Difference]: Start difference. First operand 861 states and 1118 transitions. Second operand 3 states. [2019-10-13 22:05:37,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:37,061 INFO L93 Difference]: Finished difference Result 863 states and 1119 transitions. [2019-10-13 22:05:37,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:05:37,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-13 22:05:37,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:37,067 INFO L225 Difference]: With dead ends: 863 [2019-10-13 22:05:37,067 INFO L226 Difference]: Without dead ends: 860 [2019-10-13 22:05:37,068 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-13 22:05:37,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-10-13 22:05:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 860. [2019-10-13 22:05:37,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-10-13 22:05:37,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1116 transitions. [2019-10-13 22:05:37,130 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1116 transitions. Word has length 45 [2019-10-13 22:05:37,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:37,131 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1116 transitions. [2019-10-13 22:05:37,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:05:37,131 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1116 transitions. [2019-10-13 22:05:37,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 22:05:37,132 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:37,133 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-13 22:05:37,133 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:37,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:37,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1161320697, now seen corresponding path program 1 times [2019-10-13 22:05:37,134 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:37,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060967274] [2019-10-13 22:05:37,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:37,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:37,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:37,242 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-13 22:05:37,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060967274] [2019-10-13 22:05:37,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:37,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:05:37,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648035959] [2019-10-13 22:05:37,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:05:37,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:37,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:05:37,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:05:37,245 INFO L87 Difference]: Start difference. First operand 860 states and 1116 transitions. Second operand 3 states. [2019-10-13 22:05:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:37,471 INFO L93 Difference]: Finished difference Result 991 states and 1283 transitions. [2019-10-13 22:05:37,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:05:37,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-13 22:05:37,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:37,479 INFO L225 Difference]: With dead ends: 991 [2019-10-13 22:05:37,479 INFO L226 Difference]: Without dead ends: 950 [2019-10-13 22:05:37,480 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-13 22:05:37,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2019-10-13 22:05:37,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2019-10-13 22:05:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 950 states. [2019-10-13 22:05:37,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1234 transitions. [2019-10-13 22:05:37,552 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1234 transitions. Word has length 46 [2019-10-13 22:05:37,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:37,553 INFO L462 AbstractCegarLoop]: Abstraction has 950 states and 1234 transitions. [2019-10-13 22:05:37,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:05:37,553 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1234 transitions. [2019-10-13 22:05:37,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 22:05:37,556 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:37,556 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-13 22:05:37,557 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:37,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:37,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1346056143, now seen corresponding path program 1 times [2019-10-13 22:05:37,557 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:37,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354364825] [2019-10-13 22:05:37,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:37,558 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:37,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:37,706 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-13 22:05:37,706 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354364825] [2019-10-13 22:05:37,707 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:37,707 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 22:05:37,707 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580044094] [2019-10-13 22:05:37,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 22:05:37,708 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:37,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 22:05:37,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 22:05:37,709 INFO L87 Difference]: Start difference. First operand 950 states and 1234 transitions. Second operand 6 states. [2019-10-13 22:05:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:37,818 INFO L93 Difference]: Finished difference Result 1916 states and 2500 transitions. [2019-10-13 22:05:37,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:05:37,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-10-13 22:05:37,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:37,826 INFO L225 Difference]: With dead ends: 1916 [2019-10-13 22:05:37,827 INFO L226 Difference]: Without dead ends: 984 [2019-10-13 22:05:37,832 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-13 22:05:37,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2019-10-13 22:05:37,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 984. [2019-10-13 22:05:37,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 984 states. [2019-10-13 22:05:37,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 984 states to 984 states and 1282 transitions. [2019-10-13 22:05:37,896 INFO L78 Accepts]: Start accepts. Automaton has 984 states and 1282 transitions. Word has length 89 [2019-10-13 22:05:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:37,897 INFO L462 AbstractCegarLoop]: Abstraction has 984 states and 1282 transitions. [2019-10-13 22:05:37,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 22:05:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 984 states and 1282 transitions. [2019-10-13 22:05:37,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 22:05:37,900 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:37,900 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-13 22:05:37,901 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:37,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1383285675, now seen corresponding path program 1 times [2019-10-13 22:05:37,901 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:37,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105890074] [2019-10-13 22:05:37,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:37,902 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:37,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:38,135 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-13 22:05:38,135 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105890074] [2019-10-13 22:05:38,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:38,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:05:38,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829255194] [2019-10-13 22:05:38,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:05:38,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:38,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:05:38,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:05:38,137 INFO L87 Difference]: Start difference. First operand 984 states and 1282 transitions. Second operand 4 states. [2019-10-13 22:05:39,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:39,131 INFO L93 Difference]: Finished difference Result 1956 states and 2568 transitions. [2019-10-13 22:05:39,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:05:39,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-13 22:05:39,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:39,145 INFO L225 Difference]: With dead ends: 1956 [2019-10-13 22:05:39,146 INFO L226 Difference]: Without dead ends: 990 [2019-10-13 22:05:39,152 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-13 22:05:39,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2019-10-13 22:05:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 988. [2019-10-13 22:05:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2019-10-13 22:05:39,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1286 transitions. [2019-10-13 22:05:39,238 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1286 transitions. Word has length 104 [2019-10-13 22:05:39,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:39,239 INFO L462 AbstractCegarLoop]: Abstraction has 988 states and 1286 transitions. [2019-10-13 22:05:39,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:05:39,239 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1286 transitions. [2019-10-13 22:05:39,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 22:05:39,250 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:39,250 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-13 22:05:39,250 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:39,251 INFO L82 PathProgramCache]: Analyzing trace with hash 400440286, now seen corresponding path program 1 times [2019-10-13 22:05:39,252 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:39,252 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863698311] [2019-10-13 22:05:39,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:39,252 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:39,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:39,448 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-13 22:05:39,449 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863698311] [2019-10-13 22:05:39,449 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:39,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:05:39,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632095810] [2019-10-13 22:05:39,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:05:39,450 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:39,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:05:39,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:05:39,451 INFO L87 Difference]: Start difference. First operand 988 states and 1286 transitions. Second operand 4 states. [2019-10-13 22:05:39,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:39,564 INFO L93 Difference]: Finished difference Result 2026 states and 2681 transitions. [2019-10-13 22:05:39,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:05:39,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-10-13 22:05:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:39,574 INFO L225 Difference]: With dead ends: 2026 [2019-10-13 22:05:39,574 INFO L226 Difference]: Without dead ends: 1056 [2019-10-13 22:05:39,579 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-13 22:05:39,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-10-13 22:05:39,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 996. [2019-10-13 22:05:39,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-10-13 22:05:39,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1294 transitions. [2019-10-13 22:05:39,654 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1294 transitions. Word has length 147 [2019-10-13 22:05:39,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:39,654 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1294 transitions. [2019-10-13 22:05:39,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:05:39,655 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1294 transitions. [2019-10-13 22:05:39,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 22:05:39,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:39,660 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-13 22:05:39,660 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:39,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:39,660 INFO L82 PathProgramCache]: Analyzing trace with hash 412473398, now seen corresponding path program 1 times [2019-10-13 22:05:39,660 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:39,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730056825] [2019-10-13 22:05:39,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:39,661 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:39,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:39,876 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-13 22:05:39,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730056825] [2019-10-13 22:05:39,877 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:39,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 22:05:39,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500375157] [2019-10-13 22:05:39,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 22:05:39,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:39,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 22:05:39,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 22:05:39,880 INFO L87 Difference]: Start difference. First operand 996 states and 1294 transitions. Second operand 3 states. [2019-10-13 22:05:40,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:40,126 INFO L93 Difference]: Finished difference Result 1990 states and 2619 transitions. [2019-10-13 22:05:40,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 22:05:40,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-10-13 22:05:40,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:40,134 INFO L225 Difference]: With dead ends: 1990 [2019-10-13 22:05:40,134 INFO L226 Difference]: Without dead ends: 1012 [2019-10-13 22:05:40,138 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-13 22:05:40,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2019-10-13 22:05:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1004. [2019-10-13 22:05:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1004 states. [2019-10-13 22:05:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1004 states to 1004 states and 1302 transitions. [2019-10-13 22:05:40,207 INFO L78 Accepts]: Start accepts. Automaton has 1004 states and 1302 transitions. Word has length 156 [2019-10-13 22:05:40,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:40,209 INFO L462 AbstractCegarLoop]: Abstraction has 1004 states and 1302 transitions. [2019-10-13 22:05:40,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 22:05:40,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1004 states and 1302 transitions. [2019-10-13 22:05:40,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-13 22:05:40,215 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:40,215 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-13 22:05:40,215 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:40,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:40,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1369600157, now seen corresponding path program 1 times [2019-10-13 22:05:40,216 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:40,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950714078] [2019-10-13 22:05:40,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:40,217 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:40,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:40,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:40,439 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-13 22:05:40,440 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950714078] [2019-10-13 22:05:40,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:40,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:05:40,441 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118753485] [2019-10-13 22:05:40,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:05:40,442 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:40,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:05:40,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:05:40,443 INFO L87 Difference]: Start difference. First operand 1004 states and 1302 transitions. Second operand 5 states. [2019-10-13 22:05:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:40,524 INFO L93 Difference]: Finished difference Result 2006 states and 2612 transitions. [2019-10-13 22:05:40,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:05:40,525 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 165 [2019-10-13 22:05:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:40,532 INFO L225 Difference]: With dead ends: 2006 [2019-10-13 22:05:40,533 INFO L226 Difference]: Without dead ends: 1020 [2019-10-13 22:05:40,537 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-13 22:05:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2019-10-13 22:05:40,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1012. [2019-10-13 22:05:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1012 states. [2019-10-13 22:05:40,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1314 transitions. [2019-10-13 22:05:40,608 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1314 transitions. Word has length 165 [2019-10-13 22:05:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:40,608 INFO L462 AbstractCegarLoop]: Abstraction has 1012 states and 1314 transitions. [2019-10-13 22:05:40,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:05:40,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1314 transitions. [2019-10-13 22:05:40,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-13 22:05:40,612 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:40,613 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-13 22:05:40,613 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:40,614 INFO L82 PathProgramCache]: Analyzing trace with hash 915393057, now seen corresponding path program 1 times [2019-10-13 22:05:40,615 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:40,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676040913] [2019-10-13 22:05:40,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:40,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:40,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:40,874 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-13 22:05:40,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676040913] [2019-10-13 22:05:40,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:40,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:05:40,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608385564] [2019-10-13 22:05:40,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:05:40,878 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:40,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:05:40,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:05:40,879 INFO L87 Difference]: Start difference. First operand 1012 states and 1314 transitions. Second operand 5 states. [2019-10-13 22:05:41,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:41,015 INFO L93 Difference]: Finished difference Result 2066 states and 2704 transitions. [2019-10-13 22:05:41,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 22:05:41,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-10-13 22:05:41,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:41,027 INFO L225 Difference]: With dead ends: 2066 [2019-10-13 22:05:41,027 INFO L226 Difference]: Without dead ends: 1072 [2019-10-13 22:05:41,034 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-13 22:05:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2019-10-13 22:05:41,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 1020. [2019-10-13 22:05:41,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1020 states. [2019-10-13 22:05:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1020 states to 1020 states and 1322 transitions. [2019-10-13 22:05:41,142 INFO L78 Accepts]: Start accepts. Automaton has 1020 states and 1322 transitions. Word has length 174 [2019-10-13 22:05:41,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:41,143 INFO L462 AbstractCegarLoop]: Abstraction has 1020 states and 1322 transitions. [2019-10-13 22:05:41,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:05:41,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1020 states and 1322 transitions. [2019-10-13 22:05:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-13 22:05:41,150 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:41,151 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, 1, 1] [2019-10-13 22:05:41,151 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:41,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:41,152 INFO L82 PathProgramCache]: Analyzing trace with hash -696453331, now seen corresponding path program 1 times [2019-10-13 22:05:41,152 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:41,152 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462685597] [2019-10-13 22:05:41,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:41,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:41,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:41,564 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-13 22:05:41,564 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462685597] [2019-10-13 22:05:41,564 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:41,565 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 22:05:41,565 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916150482] [2019-10-13 22:05:41,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 22:05:41,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:41,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 22:05:41,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:05:41,566 INFO L87 Difference]: Start difference. First operand 1020 states and 1322 transitions. Second operand 5 states. [2019-10-13 22:05:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:41,645 INFO L93 Difference]: Finished difference Result 2058 states and 2706 transitions. [2019-10-13 22:05:41,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 22:05:41,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-10-13 22:05:41,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:41,655 INFO L225 Difference]: With dead ends: 2058 [2019-10-13 22:05:41,655 INFO L226 Difference]: Without dead ends: 1056 [2019-10-13 22:05:41,661 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-13 22:05:41,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2019-10-13 22:05:41,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1036. [2019-10-13 22:05:41,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-10-13 22:05:41,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 1350 transitions. [2019-10-13 22:05:41,735 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 1350 transitions. Word has length 213 [2019-10-13 22:05:41,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:41,736 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 1350 transitions. [2019-10-13 22:05:41,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 22:05:41,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1350 transitions. [2019-10-13 22:05:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-13 22:05:41,741 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:41,742 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-13 22:05:41,742 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:41,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:41,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1402068112, now seen corresponding path program 1 times [2019-10-13 22:05:41,743 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:41,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471771193] [2019-10-13 22:05:41,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:41,743 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:41,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:42,132 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-13 22:05:42,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471771193] [2019-10-13 22:05:42,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:42,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 22:05:42,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528856928] [2019-10-13 22:05:42,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 22:05:42,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:42,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 22:05:42,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:05:42,138 INFO L87 Difference]: Start difference. First operand 1036 states and 1350 transitions. Second operand 10 states. [2019-10-13 22:05:42,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:42,317 INFO L93 Difference]: Finished difference Result 2094 states and 2758 transitions. [2019-10-13 22:05:42,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 22:05:42,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 235 [2019-10-13 22:05:42,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:42,331 INFO L225 Difference]: With dead ends: 2094 [2019-10-13 22:05:42,331 INFO L226 Difference]: Without dead ends: 1076 [2019-10-13 22:05:42,339 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-13 22:05:42,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2019-10-13 22:05:42,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 1046. [2019-10-13 22:05:42,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1046 states. [2019-10-13 22:05:42,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1362 transitions. [2019-10-13 22:05:42,423 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1362 transitions. Word has length 235 [2019-10-13 22:05:42,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:42,424 INFO L462 AbstractCegarLoop]: Abstraction has 1046 states and 1362 transitions. [2019-10-13 22:05:42,424 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 22:05:42,424 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1362 transitions. [2019-10-13 22:05:42,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-13 22:05:42,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:42,429 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-13 22:05:42,430 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:42,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:42,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1044559062, now seen corresponding path program 1 times [2019-10-13 22:05:42,430 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:42,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349368454] [2019-10-13 22:05:42,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:42,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:42,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:42,869 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-13 22:05:42,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349368454] [2019-10-13 22:05:42,870 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:42,870 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 22:05:42,870 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880217861] [2019-10-13 22:05:42,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 22:05:42,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:42,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 22:05:42,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:05:42,872 INFO L87 Difference]: Start difference. First operand 1046 states and 1362 transitions. Second operand 10 states. [2019-10-13 22:05:43,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:43,027 INFO L93 Difference]: Finished difference Result 2114 states and 2758 transitions. [2019-10-13 22:05:43,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 22:05:43,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 237 [2019-10-13 22:05:43,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:43,038 INFO L225 Difference]: With dead ends: 2114 [2019-10-13 22:05:43,038 INFO L226 Difference]: Without dead ends: 1086 [2019-10-13 22:05:43,045 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-13 22:05:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1086 states. [2019-10-13 22:05:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1086 to 1048. [2019-10-13 22:05:43,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-13 22:05:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1364 transitions. [2019-10-13 22:05:43,123 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1364 transitions. Word has length 237 [2019-10-13 22:05:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:43,124 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1364 transitions. [2019-10-13 22:05:43,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 22:05:43,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1364 transitions. [2019-10-13 22:05:43,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-13 22:05:43,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:43,130 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-13 22:05:43,130 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:43,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:43,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1309145940, now seen corresponding path program 1 times [2019-10-13 22:05:43,131 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:43,131 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467144421] [2019-10-13 22:05:43,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:43,132 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:43,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:43,467 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-13 22:05:43,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467144421] [2019-10-13 22:05:43,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:43,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 22:05:43,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918053359] [2019-10-13 22:05:43,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 22:05:43,470 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:43,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 22:05:43,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:05:43,471 INFO L87 Difference]: Start difference. First operand 1048 states and 1364 transitions. Second operand 10 states. [2019-10-13 22:05:43,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:43,621 INFO L93 Difference]: Finished difference Result 2160 states and 2838 transitions. [2019-10-13 22:05:43,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 22:05:43,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 244 [2019-10-13 22:05:43,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:43,631 INFO L225 Difference]: With dead ends: 2160 [2019-10-13 22:05:43,631 INFO L226 Difference]: Without dead ends: 1130 [2019-10-13 22:05:43,636 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-13 22:05:43,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2019-10-13 22:05:43,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1048. [2019-10-13 22:05:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-13 22:05:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1364 transitions. [2019-10-13 22:05:43,708 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1364 transitions. Word has length 244 [2019-10-13 22:05:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:43,709 INFO L462 AbstractCegarLoop]: Abstraction has 1048 states and 1364 transitions. [2019-10-13 22:05:43,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 22:05:43,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1364 transitions. [2019-10-13 22:05:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-13 22:05:43,716 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:43,717 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-13 22:05:43,717 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:43,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:43,718 INFO L82 PathProgramCache]: Analyzing trace with hash 822307866, now seen corresponding path program 1 times [2019-10-13 22:05:43,718 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:43,718 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457875126] [2019-10-13 22:05:43,718 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:43,719 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:43,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:44,129 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-13 22:05:44,129 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457875126] [2019-10-13 22:05:44,129 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:05:44,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 22:05:44,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508975713] [2019-10-13 22:05:44,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 22:05:44,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:44,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 22:05:44,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:05:44,138 INFO L87 Difference]: Start difference. First operand 1048 states and 1364 transitions. Second operand 10 states. [2019-10-13 22:05:44,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:44,333 INFO L93 Difference]: Finished difference Result 2172 states and 2850 transitions. [2019-10-13 22:05:44,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 22:05:44,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 246 [2019-10-13 22:05:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:44,346 INFO L225 Difference]: With dead ends: 2172 [2019-10-13 22:05:44,347 INFO L226 Difference]: Without dead ends: 1142 [2019-10-13 22:05:44,354 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-13 22:05:44,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1142 states. [2019-10-13 22:05:44,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1142 to 1044. [2019-10-13 22:05:44,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1044 states. [2019-10-13 22:05:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1356 transitions. [2019-10-13 22:05:44,446 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1356 transitions. Word has length 246 [2019-10-13 22:05:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:44,447 INFO L462 AbstractCegarLoop]: Abstraction has 1044 states and 1356 transitions. [2019-10-13 22:05:44,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 22:05:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1356 transitions. [2019-10-13 22:05:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2019-10-13 22:05:44,453 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:44,453 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-13 22:05:44,453 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:44,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:44,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1872541421, now seen corresponding path program 1 times [2019-10-13 22:05:44,454 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:44,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615701215] [2019-10-13 22:05:44,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:44,455 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:44,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:44,776 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-13 22:05:44,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615701215] [2019-10-13 22:05:44,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710345032] [2019-10-13 22:05:44,777 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-13 22:05:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:45,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 2898 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 22:05:45,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:05:45,745 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-13 22:05:45,745 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:05:46,559 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-13 22:05:46,559 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 22:05:46,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [8] total 10 [2019-10-13 22:05:46,560 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630713611] [2019-10-13 22:05:46,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:05:46,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:05:46,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:05:46,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-13 22:05:46,562 INFO L87 Difference]: Start difference. First operand 1044 states and 1356 transitions. Second operand 4 states. [2019-10-13 22:05:46,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:05:46,663 INFO L93 Difference]: Finished difference Result 2078 states and 2706 transitions. [2019-10-13 22:05:46,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:05:46,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 270 [2019-10-13 22:05:46,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:05:46,671 INFO L225 Difference]: With dead ends: 2078 [2019-10-13 22:05:46,671 INFO L226 Difference]: Without dead ends: 1052 [2019-10-13 22:05:46,676 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-13 22:05:46,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-13 22:05:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-10-13 22:05:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-10-13 22:05:46,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1366 transitions. [2019-10-13 22:05:46,761 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1366 transitions. Word has length 270 [2019-10-13 22:05:46,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:05:46,762 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1366 transitions. [2019-10-13 22:05:46,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:05:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1366 transitions. [2019-10-13 22:05:46,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-10-13 22:05:46,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:05:46,770 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-13 22:05:46,981 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:05:46,982 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:05:46,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:05:46,982 INFO L82 PathProgramCache]: Analyzing trace with hash 175399987, now seen corresponding path program 1 times [2019-10-13 22:05:46,983 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:05:46,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992732051] [2019-10-13 22:05:46,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:46,983 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:05:46,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:05:47,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:47,262 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-13 22:05:47,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992732051] [2019-10-13 22:05:47,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322792275] [2019-10-13 22:05:47,263 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-13 22:05:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:05:48,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 2920 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 22:05:48,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:05:48,496 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-13 22:05:48,496 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:05:49,411 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-13 22:05:49,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [630318548] [2019-10-13 22:05:49,471 INFO L162 IcfgInterpreter]: Started Sifa with 204 locations of interest [2019-10-13 22:05:49,471 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:05:49,485 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:05:49,495 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:05:49,496 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs