java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 11:25:33,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 11:25:33,438 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 11:25:33,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 11:25:33,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 11:25:33,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 11:25:33,457 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 11:25:33,459 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 11:25:33,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 11:25:33,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 11:25:33,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 11:25:33,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 11:25:33,464 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 11:25:33,465 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 11:25:33,466 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 11:25:33,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 11:25:33,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 11:25:33,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 11:25:33,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 11:25:33,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 11:25:33,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 11:25:33,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 11:25:33,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 11:25:33,477 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 11:25:33,479 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 11:25:33,479 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 11:25:33,479 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 11:25:33,480 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 11:25:33,481 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 11:25:33,481 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 11:25:33,482 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 11:25:33,482 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 11:25:33,483 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 11:25:33,484 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 11:25:33,485 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 11:25:33,485 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 11:25:33,486 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 11:25:33,486 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 11:25:33,486 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 11:25:33,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 11:25:33,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 11:25:33,488 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 11:25:33,503 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 11:25:33,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 11:25:33,503 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 11:25:33,504 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 11:25:33,504 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 11:25:33,504 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 11:25:33,505 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 11:25:33,505 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 11:25:33,505 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 11:25:33,505 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 11:25:33,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 11:25:33,506 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 11:25:33,506 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 11:25:33,506 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 11:25:33,507 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 11:25:33,507 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 11:25:33,507 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 11:25:33,507 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 11:25:33,507 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 11:25:33,508 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 11:25:33,508 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 11:25:33,508 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 11:25:33,508 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 11:25:33,508 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 11:25:33,509 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 11:25:33,509 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 11:25:33,509 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 11:25:33,509 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 11:25:33,509 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 11:25:33,510 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 11:25:33,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 11:25:33,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 11:25:33,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 11:25:33,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 11:25:33,565 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 11:25:33,566 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-09-10 11:25:33,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e1e7de3/e4b7c2874f0e4b33b096052fdc504ccc/FLAGecc329fb7 [2019-09-10 11:25:34,361 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 11:25:34,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.16-rc1/43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-09-10 11:25:34,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e1e7de3/e4b7c2874f0e4b33b096052fdc504ccc/FLAGecc329fb7 [2019-09-10 11:25:34,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e1e7de3/e4b7c2874f0e4b33b096052fdc504ccc [2019-09-10 11:25:34,556 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 11:25:34,557 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 11:25:34,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 11:25:34,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 11:25:34,567 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 11:25:34,568 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:25:34" (1/1) ... [2019-09-10 11:25:34,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53de433e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:34, skipping insertion in model container [2019-09-10 11:25:34,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 11:25:34" (1/1) ... [2019-09-10 11:25:34,577 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 11:25:34,662 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 11:25:35,102 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-09-10 11:25:35,103 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-09-10 11:25:35,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 11:25:35,645 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 11:25:35,728 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [1753] [2019-09-10 11:25:35,729 WARN L1127 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [1754-1755] [2019-09-10 11:25:35,794 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 11:25:35,871 INFO L192 MainTranslator]: Completed translation [2019-09-10 11:25:35,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:35 WrapperNode [2019-09-10 11:25:35,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 11:25:35,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 11:25:35,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 11:25:35,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 11:25:35,893 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:35" (1/1) ... [2019-09-10 11:25:35,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:35" (1/1) ... [2019-09-10 11:25:35,936 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:35" (1/1) ... [2019-09-10 11:25:35,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:35" (1/1) ... [2019-09-10 11:25:36,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:35" (1/1) ... [2019-09-10 11:25:36,034 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:35" (1/1) ... [2019-09-10 11:25:36,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:35" (1/1) ... [2019-09-10 11:25:36,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 11:25:36,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 11:25:36,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 11:25:36,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 11:25:36,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 11:25:36,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 11:25:36,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 11:25:36,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~int [2019-09-10 11:25:36,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-10 11:25:36,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-09-10 11:25:36,173 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2019-09-10 11:25:36,174 INFO L138 BoogieDeclarations]: Found implementation of procedure bitmap_weight [2019-09-10 11:25:36,175 INFO L138 BoogieDeclarations]: Found implementation of procedure cpumask_weight [2019-09-10 11:25:36,175 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2019-09-10 11:25:36,176 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_inc [2019-09-10 11:25:36,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_1 [2019-09-10 11:25:36,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_5 [2019-09-10 11:25:36,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_8 [2019-09-10 11:25:36,180 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-10 11:25:36,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kmalloc_12 [2019-09-10 11:25:36,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-10 11:25:36,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-10 11:25:36,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-10 11:25:36,181 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-10 11:25:36,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-10 11:25:36,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-10 11:25:36,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-10 11:25:36,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-10 11:25:36,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-10 11:25:36,183 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_lock [2019-09-10 11:25:36,183 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_delay [2019-09-10 11:25:36,183 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_busted_write_unlock [2019-09-10 11:25:36,184 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock [2019-09-10 11:25:36,184 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_delay [2019-09-10 11:25:36,184 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_unlock [2019-09-10 11:25:36,184 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_spin_lock_write_lock_irq [2019-09-10 11:25:36,185 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_lock_spin_write_unlock_irq [2019-09-10 11:25:36,185 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_writer [2019-09-10 11:25:36,185 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_printk [2019-09-10 11:25:36,186 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats_print [2019-09-10 11:25:36,186 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_stats [2019-09-10 11:25:36,186 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_print_module_parms [2019-09-10 11:25:36,186 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_cleanup [2019-09-10 11:25:36,186 INFO L138 BoogieDeclarations]: Found implementation of procedure lock_torture_init [2019-09-10 11:25:36,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 11:25:36,187 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2019-09-10 11:25:36,187 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2019-09-10 11:25:36,187 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-09-10 11:25:36,187 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-10 11:25:36,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kmem_cache_alloc_16 [2019-09-10 11:25:36,188 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-10 11:25:36,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2019-09-10 11:25:36,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags_and_return_some_page [2019-09-10 11:25:36,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_nonatomic [2019-09-10 11:25:36,188 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2019-09-10 11:25:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2019-09-10 11:25:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_trylock [2019-09-10 11:25:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __bitmap_weight [2019-09-10 11:25:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-09-10 11:25:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure __udelay [2019-09-10 11:25:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock [2019-09-10 11:25:36,189 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock [2019-09-10 11:25:36,190 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-09-10 11:25:36,190 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_create_kthread [2019-09-10 11:25:36,190 INFO L138 BoogieDeclarations]: Found implementation of procedure _torture_stop_kthread [2019-09-10 11:25:36,190 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_alloc [2019-09-10 11:25:36,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-10 11:25:36,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-10 11:25:36,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_probe_1 [2019-09-10 11:25:36,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_probe_2 [2019-09-10 11:25:36,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_probe_3 [2019-09-10 11:25:36,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_1 [2019-09-10 11:25:36,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_2 [2019-09-10 11:25:36,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_3 [2019-09-10 11:25:36,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_some_page [2019-09-10 11:25:36,193 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-10 11:25:36,193 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-09-10 11:25:36,193 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_uninterruptible [2019-09-10 11:25:36,193 INFO L138 BoogieDeclarations]: Found implementation of procedure set_user_nice [2019-09-10 11:25:36,193 INFO L138 BoogieDeclarations]: Found implementation of procedure stutter_wait [2019-09-10 11:25:36,194 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_cleanup [2019-09-10 11:25:36,194 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_begin [2019-09-10 11:25:36,194 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_init_end [2019-09-10 11:25:36,194 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_kthread_stopping [2019-09-10 11:25:36,194 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_must_stop [2019-09-10 11:25:36,195 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_onoff_failures [2019-09-10 11:25:36,196 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_onoff_init [2019-09-10 11:25:36,196 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_random [2019-09-10 11:25:36,197 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_shuffle_init [2019-09-10 11:25:36,197 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_shutdown_absorb [2019-09-10 11:25:36,197 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_shutdown_init [2019-09-10 11:25:36,197 INFO L138 BoogieDeclarations]: Found implementation of procedure torture_stutter_init [2019-09-10 11:25:36,197 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2019-09-10 11:25:36,197 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-10 11:25:36,197 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-10 11:25:36,198 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-10 11:25:36,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 11:25:36,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 11:25:36,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-10 11:25:36,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2019-09-10 11:25:36,198 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2019-09-10 11:25:36,198 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-10 11:25:36,199 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-09-10 11:25:36,199 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-09-10 11:25:36,199 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2019-09-10 11:25:36,199 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2019-09-10 11:25:36,199 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-09-10 11:25:36,199 INFO L130 BoogieDeclarations]: Found specification of procedure __bitmap_weight [2019-09-10 11:25:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure bitmap_weight [2019-09-10 11:25:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure cpumask_weight [2019-09-10 11:25:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2019-09-10 11:25:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 11:25:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_inc [2019-09-10 11:25:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock [2019-09-10 11:25:36,200 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock [2019-09-10 11:25:36,201 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-09-10 11:25:36,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_1 [2019-09-10 11:25:36,201 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2019-09-10 11:25:36,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_5 [2019-09-10 11:25:36,201 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2019-09-10 11:25:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_8 [2019-09-10 11:25:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-09-10 11:25:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-10 11:25:36,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-10 11:25:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-10 11:25:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_alloc [2019-09-10 11:25:36,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kmem_cache_alloc_16 [2019-09-10 11:25:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kmalloc_12 [2019-09-10 11:25:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-10 11:25:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-10 11:25:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2019-09-10 11:25:36,204 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-10 11:25:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-10 11:25:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 11:25:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-10 11:25:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-10 11:25:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 11:25:36,205 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-10 11:25:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-10 11:25:36,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-10 11:25:36,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-10 11:25:36,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-10 11:25:36,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-10 11:25:36,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-10 11:25:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-10 11:25:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-10 11:25:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-09-10 11:25:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_uninterruptible [2019-09-10 11:25:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure set_user_nice [2019-09-10 11:25:36,217 INFO L130 BoogieDeclarations]: Found specification of procedure __udelay [2019-09-10 11:25:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-09-10 11:25:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure torture_onoff_init [2019-09-10 11:25:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure torture_onoff_failures [2019-09-10 11:25:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure torture_random [2019-09-10 11:25:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure torture_shuffle_init [2019-09-10 11:25:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure torture_shutdown_absorb [2019-09-10 11:25:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure torture_shutdown_init [2019-09-10 11:25:36,218 INFO L130 BoogieDeclarations]: Found specification of procedure stutter_wait [2019-09-10 11:25:36,219 INFO L130 BoogieDeclarations]: Found specification of procedure torture_stutter_init [2019-09-10 11:25:36,219 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_begin [2019-09-10 11:25:36,219 INFO L130 BoogieDeclarations]: Found specification of procedure torture_init_end [2019-09-10 11:25:36,219 INFO L130 BoogieDeclarations]: Found specification of procedure torture_cleanup [2019-09-10 11:25:36,220 INFO L130 BoogieDeclarations]: Found specification of procedure torture_must_stop [2019-09-10 11:25:36,220 INFO L130 BoogieDeclarations]: Found specification of procedure torture_kthread_stopping [2019-09-10 11:25:36,220 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_create_kthread [2019-09-10 11:25:36,220 INFO L130 BoogieDeclarations]: Found specification of procedure _torture_stop_kthread [2019-09-10 11:25:36,220 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_cleanup [2019-09-10 11:25:36,220 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_lock [2019-09-10 11:25:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_delay [2019-09-10 11:25:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_busted_write_unlock [2019-09-10 11:25:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock [2019-09-10 11:25:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_delay [2019-09-10 11:25:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_unlock [2019-09-10 11:25:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure torture_spin_lock_write_lock_irq [2019-09-10 11:25:36,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 11:25:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure torture_lock_spin_write_unlock_irq [2019-09-10 11:25:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_writer [2019-09-10 11:25:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~int [2019-09-10 11:25:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-10 11:25:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-09-10 11:25:36,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 11:25:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 11:25:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_printk [2019-09-10 11:25:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats_print [2019-09-10 11:25:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_stats [2019-09-10 11:25:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_print_module_parms [2019-09-10 11:25:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure lock_torture_init [2019-09-10 11:25:36,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 11:25:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_probe_1 [2019-09-10 11:25:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-10 11:25:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_2 [2019-09-10 11:25:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-10 11:25:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_3 [2019-09-10 11:25:36,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_probe_3 [2019-09-10 11:25:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_probe_2 [2019-09-10 11:25:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_1 [2019-09-10 11:25:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 11:25:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_some_page [2019-09-10 11:25:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags_and_return_some_page [2019-09-10 11:25:36,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_nonatomic [2019-09-10 11:25:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_trylock [2019-09-10 11:25:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-10 11:25:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-10 11:25:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 11:25:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 11:25:36,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 11:25:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 11:25:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-10 11:25:36,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 11:25:36,817 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-10 11:25:38,444 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 11:25:38,445 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 11:25:38,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:25:38 BoogieIcfgContainer [2019-09-10 11:25:38,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 11:25:38,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 11:25:38,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 11:25:38,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 11:25:38,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 11:25:34" (1/3) ... [2019-09-10 11:25:38,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc957b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:25:38, skipping insertion in model container [2019-09-10 11:25:38,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 11:25:35" (2/3) ... [2019-09-10 11:25:38,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dc957b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 11:25:38, skipping insertion in model container [2019-09-10 11:25:38,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 11:25:38" (3/3) ... [2019-09-10 11:25:38,455 INFO L109 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-kernel--locking--locktorture.ko-entry_point.cil.out.i [2019-09-10 11:25:38,464 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 11:25:38,479 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 11:25:38,497 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 11:25:38,535 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 11:25:38,536 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 11:25:38,536 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 11:25:38,536 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 11:25:38,536 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 11:25:38,536 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 11:25:38,536 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 11:25:38,537 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 11:25:38,575 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states. [2019-09-10 11:25:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-10 11:25:38,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:38,612 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 11:25:38,615 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:38,621 INFO L82 PathProgramCache]: Analyzing trace with hash 87098824, now seen corresponding path program 1 times [2019-09-10 11:25:38,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:38,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:38,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:38,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:38,689 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 11:25:39,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:39,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 11:25:39,148 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:39,154 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 11:25:39,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 11:25:39,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:39,171 INFO L87 Difference]: Start difference. First operand 581 states. Second operand 3 states. [2019-09-10 11:25:39,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:39,606 INFO L93 Difference]: Finished difference Result 784 states and 1001 transitions. [2019-09-10 11:25:39,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 11:25:39,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-10 11:25:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:39,650 INFO L225 Difference]: With dead ends: 784 [2019-09-10 11:25:39,650 INFO L226 Difference]: Without dead ends: 697 [2019-09-10 11:25:39,658 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-09-10 11:25:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 694. [2019-09-10 11:25:39,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-10 11:25:39,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 885 transitions. [2019-09-10 11:25:39,811 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 885 transitions. Word has length 56 [2019-09-10 11:25:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:39,813 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 885 transitions. [2019-09-10 11:25:39,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 11:25:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 885 transitions. [2019-09-10 11:25:39,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-10 11:25:39,824 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:39,825 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 11:25:39,825 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:39,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:39,826 INFO L82 PathProgramCache]: Analyzing trace with hash -739029581, now seen corresponding path program 1 times [2019-09-10 11:25:39,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:39,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:39,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:39,832 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:40,029 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 11:25:40,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:40,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 11:25:40,029 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:40,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 11:25:40,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 11:25:40,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:40,033 INFO L87 Difference]: Start difference. First operand 694 states and 885 transitions. Second operand 3 states. [2019-09-10 11:25:40,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:40,063 INFO L93 Difference]: Finished difference Result 694 states and 884 transitions. [2019-09-10 11:25:40,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 11:25:40,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-09-10 11:25:40,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:40,070 INFO L225 Difference]: With dead ends: 694 [2019-09-10 11:25:40,070 INFO L226 Difference]: Without dead ends: 694 [2019-09-10 11:25:40,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:40,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-09-10 11:25:40,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 694. [2019-09-10 11:25:40,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2019-09-10 11:25:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 884 transitions. [2019-09-10 11:25:40,112 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 884 transitions. Word has length 60 [2019-09-10 11:25:40,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:40,113 INFO L475 AbstractCegarLoop]: Abstraction has 694 states and 884 transitions. [2019-09-10 11:25:40,113 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 11:25:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 884 transitions. [2019-09-10 11:25:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-10 11:25:40,117 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:40,118 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 11:25:40,118 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:40,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:40,119 INFO L82 PathProgramCache]: Analyzing trace with hash -32542523, now seen corresponding path program 1 times [2019-09-10 11:25:40,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:40,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:40,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:40,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:40,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:40,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:40,332 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 11:25:40,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:40,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 11:25:40,332 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:40,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 11:25:40,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 11:25:40,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:40,334 INFO L87 Difference]: Start difference. First operand 694 states and 884 transitions. Second operand 3 states. [2019-09-10 11:25:40,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:40,369 INFO L93 Difference]: Finished difference Result 1257 states and 1652 transitions. [2019-09-10 11:25:40,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 11:25:40,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-10 11:25:40,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:40,381 INFO L225 Difference]: With dead ends: 1257 [2019-09-10 11:25:40,382 INFO L226 Difference]: Without dead ends: 1229 [2019-09-10 11:25:40,382 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:40,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2019-09-10 11:25:40,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1187. [2019-09-10 11:25:40,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1187 states. [2019-09-10 11:25:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1551 transitions. [2019-09-10 11:25:40,418 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1551 transitions. Word has length 71 [2019-09-10 11:25:40,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:40,418 INFO L475 AbstractCegarLoop]: Abstraction has 1187 states and 1551 transitions. [2019-09-10 11:25:40,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 11:25:40,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1551 transitions. [2019-09-10 11:25:40,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 11:25:40,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:40,423 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-10 11:25:40,423 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:40,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1396727854, now seen corresponding path program 1 times [2019-09-10 11:25:40,424 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:40,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:40,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:40,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:40,426 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:40,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:40,514 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 11:25:40,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:40,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 11:25:40,515 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:40,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 11:25:40,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 11:25:40,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:40,516 INFO L87 Difference]: Start difference. First operand 1187 states and 1551 transitions. Second operand 3 states. [2019-09-10 11:25:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:40,613 INFO L93 Difference]: Finished difference Result 2195 states and 2853 transitions. [2019-09-10 11:25:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 11:25:40,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-09-10 11:25:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:40,625 INFO L225 Difference]: With dead ends: 2195 [2019-09-10 11:25:40,625 INFO L226 Difference]: Without dead ends: 2195 [2019-09-10 11:25:40,626 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2195 states. [2019-09-10 11:25:40,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2195 to 2164. [2019-09-10 11:25:40,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2164 states. [2019-09-10 11:25:40,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 2820 transitions. [2019-09-10 11:25:40,694 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 2820 transitions. Word has length 86 [2019-09-10 11:25:40,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:40,694 INFO L475 AbstractCegarLoop]: Abstraction has 2164 states and 2820 transitions. [2019-09-10 11:25:40,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 11:25:40,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 2820 transitions. [2019-09-10 11:25:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 11:25:40,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:40,701 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-10 11:25:40,702 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:40,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:40,702 INFO L82 PathProgramCache]: Analyzing trace with hash -2001118379, now seen corresponding path program 1 times [2019-09-10 11:25:40,702 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:40,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:40,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:40,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:40,705 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 11:25:40,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:40,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 11:25:40,850 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:40,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 11:25:40,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 11:25:40,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:40,851 INFO L87 Difference]: Start difference. First operand 2164 states and 2820 transitions. Second operand 3 states. [2019-09-10 11:25:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:40,887 INFO L93 Difference]: Finished difference Result 2176 states and 2832 transitions. [2019-09-10 11:25:40,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 11:25:40,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 11:25:40,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:40,899 INFO L225 Difference]: With dead ends: 2176 [2019-09-10 11:25:40,900 INFO L226 Difference]: Without dead ends: 2176 [2019-09-10 11:25:40,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:40,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2176 states. [2019-09-10 11:25:40,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2176 to 2172. [2019-09-10 11:25:40,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2172 states. [2019-09-10 11:25:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2172 states to 2172 states and 2828 transitions. [2019-09-10 11:25:40,999 INFO L78 Accepts]: Start accepts. Automaton has 2172 states and 2828 transitions. Word has length 92 [2019-09-10 11:25:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:41,002 INFO L475 AbstractCegarLoop]: Abstraction has 2172 states and 2828 transitions. [2019-09-10 11:25:41,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 11:25:41,003 INFO L276 IsEmpty]: Start isEmpty. Operand 2172 states and 2828 transitions. [2019-09-10 11:25:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 11:25:41,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:41,016 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-10 11:25:41,016 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:41,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:41,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1812768659, now seen corresponding path program 1 times [2019-09-10 11:25:41,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:41,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:41,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:41,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:41,022 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 11:25:41,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:41,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 11:25:41,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:41,157 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 11:25:41,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 11:25:41,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:41,159 INFO L87 Difference]: Start difference. First operand 2172 states and 2828 transitions. Second operand 3 states. [2019-09-10 11:25:41,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:41,558 INFO L93 Difference]: Finished difference Result 3255 states and 4225 transitions. [2019-09-10 11:25:41,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 11:25:41,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 11:25:41,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:41,587 INFO L225 Difference]: With dead ends: 3255 [2019-09-10 11:25:41,587 INFO L226 Difference]: Without dead ends: 3255 [2019-09-10 11:25:41,588 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:41,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3255 states. [2019-09-10 11:25:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3255 to 3222. [2019-09-10 11:25:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3222 states. [2019-09-10 11:25:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3222 states to 3222 states and 4190 transitions. [2019-09-10 11:25:41,715 INFO L78 Accepts]: Start accepts. Automaton has 3222 states and 4190 transitions. Word has length 92 [2019-09-10 11:25:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:41,716 INFO L475 AbstractCegarLoop]: Abstraction has 3222 states and 4190 transitions. [2019-09-10 11:25:41,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 11:25:41,716 INFO L276 IsEmpty]: Start isEmpty. Operand 3222 states and 4190 transitions. [2019-09-10 11:25:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 11:25:41,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:41,723 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-09-10 11:25:41,723 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:41,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1362492876, now seen corresponding path program 1 times [2019-09-10 11:25:41,724 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:41,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:41,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:41,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:41,726 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:41,852 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 11:25:41,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:41,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 11:25:41,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:41,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 11:25:41,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 11:25:41,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:41,855 INFO L87 Difference]: Start difference. First operand 3222 states and 4190 transitions. Second operand 3 states. [2019-09-10 11:25:42,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:42,055 INFO L93 Difference]: Finished difference Result 5824 states and 7543 transitions. [2019-09-10 11:25:42,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 11:25:42,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-09-10 11:25:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:42,105 INFO L225 Difference]: With dead ends: 5824 [2019-09-10 11:25:42,106 INFO L226 Difference]: Without dead ends: 5824 [2019-09-10 11:25:42,106 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5824 states. [2019-09-10 11:25:42,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5824 to 5793. [2019-09-10 11:25:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5793 states. [2019-09-10 11:25:42,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5793 states to 5793 states and 7510 transitions. [2019-09-10 11:25:42,394 INFO L78 Accepts]: Start accepts. Automaton has 5793 states and 7510 transitions. Word has length 100 [2019-09-10 11:25:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:42,394 INFO L475 AbstractCegarLoop]: Abstraction has 5793 states and 7510 transitions. [2019-09-10 11:25:42,394 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 11:25:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 5793 states and 7510 transitions. [2019-09-10 11:25:42,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 11:25:42,405 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:42,405 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-09-10 11:25:42,405 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:42,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:42,406 INFO L82 PathProgramCache]: Analyzing trace with hash 453316277, now seen corresponding path program 1 times [2019-09-10 11:25:42,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:42,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:42,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:42,408 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:42,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:42,507 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 11:25:42,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:42,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 11:25:42,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:42,508 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 11:25:42,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 11:25:42,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:42,509 INFO L87 Difference]: Start difference. First operand 5793 states and 7510 transitions. Second operand 3 states. [2019-09-10 11:25:42,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:42,906 INFO L93 Difference]: Finished difference Result 8669 states and 11216 transitions. [2019-09-10 11:25:42,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 11:25:42,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-09-10 11:25:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:42,955 INFO L225 Difference]: With dead ends: 8669 [2019-09-10 11:25:42,956 INFO L226 Difference]: Without dead ends: 8669 [2019-09-10 11:25:42,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 11:25:42,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8669 states. [2019-09-10 11:25:43,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8669 to 8632. [2019-09-10 11:25:43,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8632 states. [2019-09-10 11:25:43,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8632 states to 8632 states and 11177 transitions. [2019-09-10 11:25:43,207 INFO L78 Accepts]: Start accepts. Automaton has 8632 states and 11177 transitions. Word has length 106 [2019-09-10 11:25:43,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:43,207 INFO L475 AbstractCegarLoop]: Abstraction has 8632 states and 11177 transitions. [2019-09-10 11:25:43,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 11:25:43,208 INFO L276 IsEmpty]: Start isEmpty. Operand 8632 states and 11177 transitions. [2019-09-10 11:25:43,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-10 11:25:43,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:43,221 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 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] [2019-09-10 11:25:43,221 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:43,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:43,222 INFO L82 PathProgramCache]: Analyzing trace with hash 389854793, now seen corresponding path program 1 times [2019-09-10 11:25:43,222 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:43,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:43,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:43,224 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:43,468 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 11:25:43,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:43,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 11:25:43,469 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:43,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 11:25:43,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 11:25:43,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 11:25:43,470 INFO L87 Difference]: Start difference. First operand 8632 states and 11177 transitions. Second operand 5 states. [2019-09-10 11:25:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:43,815 INFO L93 Difference]: Finished difference Result 8722 states and 11249 transitions. [2019-09-10 11:25:43,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 11:25:43,816 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-10 11:25:43,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:43,862 INFO L225 Difference]: With dead ends: 8722 [2019-09-10 11:25:43,862 INFO L226 Difference]: Without dead ends: 8542 [2019-09-10 11:25:43,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 11:25:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8542 states. [2019-09-10 11:25:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8542 to 8524. [2019-09-10 11:25:44,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8524 states. [2019-09-10 11:25:44,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8524 states to 8524 states and 10997 transitions. [2019-09-10 11:25:44,127 INFO L78 Accepts]: Start accepts. Automaton has 8524 states and 10997 transitions. Word has length 106 [2019-09-10 11:25:44,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:44,128 INFO L475 AbstractCegarLoop]: Abstraction has 8524 states and 10997 transitions. [2019-09-10 11:25:44,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 11:25:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 8524 states and 10997 transitions. [2019-09-10 11:25:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-10 11:25:44,138 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:44,138 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 11:25:44,138 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:44,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:44,139 INFO L82 PathProgramCache]: Analyzing trace with hash -225486702, now seen corresponding path program 1 times [2019-09-10 11:25:44,139 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:44,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:44,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:44,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:44,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 11:25:44,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:44,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 11:25:44,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:44,310 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 11:25:44,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 11:25:44,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 11:25:44,311 INFO L87 Difference]: Start difference. First operand 8524 states and 10997 transitions. Second operand 6 states. [2019-09-10 11:25:44,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:44,729 INFO L93 Difference]: Finished difference Result 8668 states and 11168 transitions. [2019-09-10 11:25:44,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 11:25:44,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2019-09-10 11:25:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:44,771 INFO L225 Difference]: With dead ends: 8668 [2019-09-10 11:25:44,771 INFO L226 Difference]: Without dead ends: 8506 [2019-09-10 11:25:44,772 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-10 11:25:44,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8506 states. [2019-09-10 11:25:45,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8506 to 8506. [2019-09-10 11:25:45,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8506 states. [2019-09-10 11:25:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8506 states to 8506 states and 10952 transitions. [2019-09-10 11:25:45,072 INFO L78 Accepts]: Start accepts. Automaton has 8506 states and 10952 transitions. Word has length 173 [2019-09-10 11:25:45,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:45,073 INFO L475 AbstractCegarLoop]: Abstraction has 8506 states and 10952 transitions. [2019-09-10 11:25:45,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 11:25:45,073 INFO L276 IsEmpty]: Start isEmpty. Operand 8506 states and 10952 transitions. [2019-09-10 11:25:45,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-10 11:25:45,082 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:45,082 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 11:25:45,083 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:45,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:45,083 INFO L82 PathProgramCache]: Analyzing trace with hash 241093341, now seen corresponding path program 1 times [2019-09-10 11:25:45,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:45,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:45,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:45,086 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:45,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:45,237 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 11:25:45,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:45,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 11:25:45,238 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:45,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 11:25:45,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 11:25:45,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 11:25:45,239 INFO L87 Difference]: Start difference. First operand 8506 states and 10952 transitions. Second operand 4 states. [2019-09-10 11:25:45,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:45,991 INFO L93 Difference]: Finished difference Result 8398 states and 10808 transitions. [2019-09-10 11:25:45,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 11:25:45,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 179 [2019-09-10 11:25:45,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:46,022 INFO L225 Difference]: With dead ends: 8398 [2019-09-10 11:25:46,022 INFO L226 Difference]: Without dead ends: 8398 [2019-09-10 11:25:46,024 INFO L628 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-09-10 11:25:46,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8398 states. [2019-09-10 11:25:46,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8398 to 8398. [2019-09-10 11:25:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8398 states. [2019-09-10 11:25:46,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8398 states to 8398 states and 10808 transitions. [2019-09-10 11:25:46,325 INFO L78 Accepts]: Start accepts. Automaton has 8398 states and 10808 transitions. Word has length 179 [2019-09-10 11:25:46,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:46,326 INFO L475 AbstractCegarLoop]: Abstraction has 8398 states and 10808 transitions. [2019-09-10 11:25:46,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 11:25:46,326 INFO L276 IsEmpty]: Start isEmpty. Operand 8398 states and 10808 transitions. [2019-09-10 11:25:46,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-10 11:25:46,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 11:25:46,335 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 11:25:46,335 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 11:25:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 11:25:46,336 INFO L82 PathProgramCache]: Analyzing trace with hash -722341153, now seen corresponding path program 1 times [2019-09-10 11:25:46,336 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 11:25:46,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:46,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 11:25:46,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 11:25:46,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 11:25:46,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 11:25:46,497 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-10 11:25:46,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 11:25:46,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 11:25:46,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 11:25:46,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 11:25:46,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 11:25:46,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 11:25:46,499 INFO L87 Difference]: Start difference. First operand 8398 states and 10808 transitions. Second operand 5 states. [2019-09-10 11:25:46,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 11:25:46,581 INFO L93 Difference]: Finished difference Result 271 states and 326 transitions. [2019-09-10 11:25:46,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 11:25:46,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 180 [2019-09-10 11:25:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 11:25:46,582 INFO L225 Difference]: With dead ends: 271 [2019-09-10 11:25:46,582 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 11:25:46,583 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 11:25:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 11:25:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 11:25:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 11:25:46,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 11:25:46,583 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 180 [2019-09-10 11:25:46,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 11:25:46,584 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 11:25:46,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 11:25:46,584 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 11:25:46,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 11:25:46,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 11:25:46 BoogieIcfgContainer [2019-09-10 11:25:46,591 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 11:25:46,595 INFO L168 Benchmark]: Toolchain (without parser) took 12036.11 ms. Allocated memory was 134.2 MB in the beginning and 482.3 MB in the end (delta: 348.1 MB). Free memory was 86.7 MB in the beginning and 275.1 MB in the end (delta: -188.4 MB). Peak memory consumption was 159.8 MB. Max. memory is 7.1 GB. [2019-09-10 11:25:46,596 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-09-10 11:25:46,598 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1313.90 ms. Allocated memory was 134.2 MB in the beginning and 202.4 MB in the end (delta: 68.2 MB). Free memory was 86.5 MB in the beginning and 129.4 MB in the end (delta: -42.8 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2019-09-10 11:25:46,599 INFO L168 Benchmark]: Boogie Preprocessor took 201.47 ms. Allocated memory is still 202.4 MB. Free memory was 129.4 MB in the beginning and 122.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 7.1 GB. [2019-09-10 11:25:46,605 INFO L168 Benchmark]: RCFGBuilder took 2372.49 ms. Allocated memory was 202.4 MB in the beginning and 262.1 MB in the end (delta: 59.8 MB). Free memory was 122.1 MB in the beginning and 168.5 MB in the end (delta: -46.5 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. [2019-09-10 11:25:46,606 INFO L168 Benchmark]: TraceAbstraction took 8143.57 ms. Allocated memory was 262.1 MB in the beginning and 482.3 MB in the end (delta: 220.2 MB). Free memory was 166.5 MB in the beginning and 275.1 MB in the end (delta: -108.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 7.1 GB. [2019-09-10 11:25:46,617 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 134.2 MB. Free memory was 108.7 MB in the beginning and 108.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1313.90 ms. Allocated memory was 134.2 MB in the beginning and 202.4 MB in the end (delta: 68.2 MB). Free memory was 86.5 MB in the beginning and 129.4 MB in the end (delta: -42.8 MB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 201.47 ms. Allocated memory is still 202.4 MB. Free memory was 129.4 MB in the beginning and 122.1 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2372.49 ms. Allocated memory was 202.4 MB in the beginning and 262.1 MB in the end (delta: 59.8 MB). Free memory was 122.1 MB in the beginning and 168.5 MB in the end (delta: -46.5 MB). Peak memory consumption was 83.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8143.57 ms. Allocated memory was 262.1 MB in the beginning and 482.3 MB in the end (delta: 220.2 MB). Free memory was 166.5 MB in the beginning and 275.1 MB in the end (delta: -108.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2009]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 91 procedures, 628 locations, 1 error locations. SAFE Result, 8.0s OverallTime, 12 OverallIterations, 4 TraceHistogramMax, 3.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7939 SDtfs, 4567 SDslu, 8562 SDs, 0 SdLazy, 372 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8632occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 199 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1301 NumberOfCodeBlocks, 1301 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1289 ConstructedInterpolants, 0 QuantifiedInterpolants, 201063 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 279/279 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...