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-drivers--block--paride--pg.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 00:56:39,205 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 00:56:39,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 00:56:39,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 00:56:39,221 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 00:56:39,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 00:56:39,225 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 00:56:39,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 00:56:39,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 00:56:39,241 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 00:56:39,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 00:56:39,243 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 00:56:39,243 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 00:56:39,244 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 00:56:39,245 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 00:56:39,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 00:56:39,247 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 00:56:39,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 00:56:39,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 00:56:39,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 00:56:39,253 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 00:56:39,254 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 00:56:39,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 00:56:39,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 00:56:39,258 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 00:56:39,258 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 00:56:39,258 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 00:56:39,259 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 00:56:39,259 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 00:56:39,260 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 00:56:39,261 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 00:56:39,261 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 00:56:39,262 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 00:56:39,263 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 00:56:39,264 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 00:56:39,264 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 00:56:39,265 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 00:56:39,265 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 00:56:39,265 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 00:56:39,266 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 00:56:39,266 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 00:56:39,267 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-10-03 00:56:39,283 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 00:56:39,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 00:56:39,284 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 00:56:39,284 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 00:56:39,285 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 00:56:39,285 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 00:56:39,286 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 00:56:39,286 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 00:56:39,286 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 00:56:39,286 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 00:56:39,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 00:56:39,287 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 00:56:39,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 00:56:39,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 00:56:39,288 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 00:56:39,288 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 00:56:39,288 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 00:56:39,289 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 00:56:39,289 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 00:56:39,289 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 00:56:39,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 00:56:39,289 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 00:56:39,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 00:56:39,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 00:56:39,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 00:56:39,290 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 00:56:39,291 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 00:56:39,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 00:56:39,291 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 00:56:39,291 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 00:56:39,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 00:56:39,355 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 00:56:39,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 00:56:39,364 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 00:56:39,364 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 00:56:39,365 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-drivers--block--paride--pg.ko-entry_point.cil.out.i [2019-10-03 00:56:39,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854066276/1d652c7d4fc14f80b2e90dd7c444c9f0/FLAGaf38403e0 [2019-10-03 00:56:40,231 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 00:56:40,232 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-drivers--block--paride--pg.ko-entry_point.cil.out.i [2019-10-03 00:56:40,267 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854066276/1d652c7d4fc14f80b2e90dd7c444c9f0/FLAGaf38403e0 [2019-10-03 00:56:40,299 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/854066276/1d652c7d4fc14f80b2e90dd7c444c9f0 [2019-10-03 00:56:40,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 00:56:40,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 00:56:40,311 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 00:56:40,311 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 00:56:40,315 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 00:56:40,316 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 12:56:40" (1/1) ... [2019-10-03 00:56:40,319 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f677d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:40, skipping insertion in model container [2019-10-03 00:56:40,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 12:56:40" (1/1) ... [2019-10-03 00:56:40,327 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 00:56:40,433 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 00:56:41,054 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3059] [2019-10-03 00:56:41,055 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3060-3061] [2019-10-03 00:56:41,728 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 00:56:41,784 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 00:56:41,879 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name show at C: (*show)(struct kobject___0 * , struct attribute___0 * , char * ) [3059] [2019-10-03 00:56:41,880 WARN L1068 CHandler]: Detected problem Invalid redeclaration of the name store at C: (*store)(struct kobject___0 * , struct attribute___0 * , char const * , size_t ) [3060-3061] [2019-10-03 00:56:42,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 00:56:42,155 INFO L192 MainTranslator]: Completed translation [2019-10-03 00:56:42,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:42 WrapperNode [2019-10-03 00:56:42,156 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 00:56:42,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 00:56:42,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 00:56:42,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 00:56:42,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:42" (1/1) ... [2019-10-03 00:56:42,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:42" (1/1) ... [2019-10-03 00:56:42,276 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:42" (1/1) ... [2019-10-03 00:56:42,279 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:42" (1/1) ... [2019-10-03 00:56:42,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:42" (1/1) ... [2019-10-03 00:56:42,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:42" (1/1) ... [2019-10-03 00:56:42,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:42" (1/1) ... [2019-10-03 00:56:42,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 00:56:42,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 00:56:42,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 00:56:42,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 00:56:42,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 00:56:42,642 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 00:56:42,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 00:56:42,643 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-10-03 00:56:42,645 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-03 00:56:42,646 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-03 00:56:42,646 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-03 00:56:42,647 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-03 00:56:42,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kmalloc_12 [2019-10-03 00:56:42,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-03 00:56:42,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-03 00:56:42,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-03 00:56:42,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-03 00:56:42,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-03 00:56:42,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-03 00:56:42,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-03 00:56:42,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-03 00:56:42,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-03 00:56:42,659 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-10-03 00:56:42,659 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-10-03 00:56:42,659 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-10-03 00:56:42,660 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-10-03 00:56:42,660 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-10-03 00:56:42,660 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init_units [2019-10-03 00:56:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-10-03 00:56:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-10-03 00:56:42,661 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-10-03 00:56:42,662 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-10-03 00:56:42,662 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2019-10-03 00:56:42,662 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2019-10-03 00:56:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2019-10-03 00:56:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2019-10-03 00:56:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2019-10-03 00:56:42,663 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-10-03 00:56:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2019-10-03 00:56:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2019-10-03 00:56:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_detect [2019-10-03 00:56:42,664 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_open [2019-10-03 00:56:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_release [2019-10-03 00:56:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2019-10-03 00:56:42,665 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_read [2019-10-03 00:56:42,666 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init [2019-10-03 00:56:42,666 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_exit [2019-10-03 00:56:42,666 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_file_operations_1 [2019-10-03 00:56:42,667 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 00:56:42,667 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-03 00:56:42,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kmem_cache_alloc_16 [2019-10-03 00:56:42,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_19 [2019-10-03 00:56:42,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_20 [2019-10-03 00:56:42,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2019-10-03 00:56:42,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags_and_return_some_page [2019-10-03 00:56:42,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_nonatomic [2019-10-03 00:56:42,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock [2019-10-03 00:56:42,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock [2019-10-03 00:56:42,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_trylock [2019-10-03 00:56:42,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-10-03 00:56:42,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-10-03 00:56:42,670 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_from_user_overflow [2019-10-03 00:56:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_to_user_overflow [2019-10-03 00:56:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-10-03 00:56:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-10-03 00:56:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-10-03 00:56:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-10-03 00:56:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-10-03 00:56:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-10-03 00:56:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-10-03 00:56:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure kmem_cache_alloc [2019-10-03 00:56:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-03 00:56:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-03 00:56:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_some_page [2019-10-03 00:56:42,674 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-03 00:56:42,674 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_nested [2019-10-03 00:56:42,674 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-03 00:56:42,674 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-10-03 00:56:42,674 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-10-03 00:56:42,675 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-10-03 00:56:42,675 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-10-03 00:56:42,675 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-10-03 00:56:42,675 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-10-03 00:56:42,676 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-10-03 00:56:42,676 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-10-03 00:56:42,676 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-10-03 00:56:42,676 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-03 00:56:42,677 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-10-03 00:56:42,677 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-03 00:56:42,677 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-03 00:56:42,677 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-03 00:56:42,678 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-03 00:56:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 00:56:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 00:56:42,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-03 00:56:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-10-03 00:56:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-03 00:56:42,679 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-03 00:56:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-03 00:56:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-03 00:56:42,680 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-03 00:56:42,681 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-10-03 00:56:42,681 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-03 00:56:42,681 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-03 00:56:42,681 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_nested [2019-10-03 00:56:42,682 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-03 00:56:42,682 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-03 00:56:42,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-03 00:56:42,683 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-03 00:56:42,683 INFO L130 BoogieDeclarations]: Found specification of procedure kmem_cache_alloc [2019-10-03 00:56:42,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kmem_cache_alloc_16 [2019-10-03 00:56:42,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kmalloc_12 [2019-10-03 00:56:42,684 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-03 00:56:42,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2019-10-03 00:56:42,684 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 00:56:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-03 00:56:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 00:56:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_size_t [2019-10-03 00:56:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_loff_t [2019-10-03 00:56:42,685 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-03 00:56:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 00:56:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 00:56:42,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 00:56:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-03 00:56:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-03 00:56:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-03 00:56:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-03 00:56:42,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-03 00:56:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-03 00:56:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-03 00:56:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-03 00:56:42,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_file_operations_1 [2019-10-03 00:56:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-10-03 00:56:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 00:56:42,689 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-10-03 00:56:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-10-03 00:56:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-10-03 00:56:42,690 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_19 [2019-10-03 00:56:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-10-03 00:56:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_20 [2019-10-03 00:56:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-10-03 00:56:42,691 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-10-03 00:56:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-10-03 00:56:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-10-03 00:56:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-10-03 00:56:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-10-03 00:56:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-10-03 00:56:42,692 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-10-03 00:56:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-10-03 00:56:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_from_user_overflow [2019-10-03 00:56:42,693 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_to_user_overflow [2019-10-03 00:56:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-10-03 00:56:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-10-03 00:56:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-10-03 00:56:42,694 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-10-03 00:56:42,695 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-10-03 00:56:42,695 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-10-03 00:56:42,695 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-10-03 00:56:42,695 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-10-03 00:56:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-10-03 00:56:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-10-03 00:56:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure pg_open [2019-10-03 00:56:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure pg_release [2019-10-03 00:56:42,696 INFO L130 BoogieDeclarations]: Found specification of procedure pg_read [2019-10-03 00:56:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2019-10-03 00:56:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure pg_detect [2019-10-03 00:56:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2019-10-03 00:56:42,697 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init_units [2019-10-03 00:56:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 00:56:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 00:56:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 00:56:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-10-03 00:56:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-10-03 00:56:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-10-03 00:56:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-10-03 00:56:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2019-10-03 00:56:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2019-10-03 00:56:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2019-10-03 00:56:42,700 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2019-10-03 00:56:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2019-10-03 00:56:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 00:56:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-10-03 00:56:42,701 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2019-10-03 00:56:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-03 00:56:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init [2019-10-03 00:56:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure pg_exit [2019-10-03 00:56:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-03 00:56:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-03 00:56:42,702 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 00:56:42,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_some_page [2019-10-03 00:56:42,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags_and_return_some_page [2019-10-03 00:56:42,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_nonatomic [2019-10-03 00:56:42,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock [2019-10-03 00:56:42,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock [2019-10-03 00:56:42,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_trylock [2019-10-03 00:56:42,704 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-03 00:56:42,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 00:56:42,704 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 00:56:42,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 00:56:42,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 00:56:42,705 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-03 00:56:42,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 00:56:43,749 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-03 00:56:46,986 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 00:56:46,986 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 00:56:46,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:56:46 BoogieIcfgContainer [2019-10-03 00:56:46,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 00:56:46,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 00:56:46,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 00:56:47,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 00:56:47,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 12:56:40" (1/3) ... [2019-10-03 00:56:47,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b142df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:56:47, skipping insertion in model container [2019-10-03 00:56:47,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 12:56:42" (2/3) ... [2019-10-03 00:56:47,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b142df2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 12:56:47, skipping insertion in model container [2019-10-03 00:56:47,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 12:56:46" (3/3) ... [2019-10-03 00:56:47,012 INFO L109 eAbstractionObserver]: Analyzing ICFG 43_2a_consumption_linux-3.16-rc1.tar.xz-43_2a-drivers--block--paride--pg.ko-entry_point.cil.out.i [2019-10-03 00:56:47,027 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 00:56:47,049 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 00:56:47,073 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 00:56:47,178 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 00:56:47,178 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 00:56:47,179 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 00:56:47,179 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 00:56:47,179 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 00:56:47,183 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 00:56:47,184 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 00:56:47,184 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 00:56:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states. [2019-10-03 00:56:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-03 00:56:47,265 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:47,266 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:47,269 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:47,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:47,278 INFO L82 PathProgramCache]: Analyzing trace with hash -130536844, now seen corresponding path program 1 times [2019-10-03 00:56:47,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:47,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:47,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:47,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:47,386 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-03 00:56:48,254 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 00:56:48,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 00:56:48,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:48,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 00:56:48,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 00:56:48,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 00:56:48,287 INFO L87 Difference]: Start difference. First operand 628 states. Second operand 3 states. [2019-10-03 00:56:48,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:48,624 INFO L93 Difference]: Finished difference Result 926 states and 1191 transitions. [2019-10-03 00:56:48,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 00:56:48,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-03 00:56:48,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:48,677 INFO L225 Difference]: With dead ends: 926 [2019-10-03 00:56:48,678 INFO L226 Difference]: Without dead ends: 853 [2019-10-03 00:56:48,680 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 00:56:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-10-03 00:56:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 841. [2019-10-03 00:56:48,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-10-03 00:56:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1088 transitions. [2019-10-03 00:56:48,833 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1088 transitions. Word has length 125 [2019-10-03 00:56:48,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:48,834 INFO L475 AbstractCegarLoop]: Abstraction has 841 states and 1088 transitions. [2019-10-03 00:56:48,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 00:56:48,834 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1088 transitions. [2019-10-03 00:56:48,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-03 00:56:48,845 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:48,845 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:48,846 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:48,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:48,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1313904650, now seen corresponding path program 1 times [2019-10-03 00:56:48,847 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:48,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:48,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:48,853 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-10-03 00:56:49,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 00:56:49,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 00:56:49,295 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:49,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 00:56:49,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 00:56:49,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 00:56:49,299 INFO L87 Difference]: Start difference. First operand 841 states and 1088 transitions. Second operand 3 states. [2019-10-03 00:56:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:49,349 INFO L93 Difference]: Finished difference Result 853 states and 1104 transitions. [2019-10-03 00:56:49,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 00:56:49,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-10-03 00:56:49,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:49,358 INFO L225 Difference]: With dead ends: 853 [2019-10-03 00:56:49,358 INFO L226 Difference]: Without dead ends: 853 [2019-10-03 00:56:49,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 00:56:49,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2019-10-03 00:56:49,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 843. [2019-10-03 00:56:49,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2019-10-03 00:56:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 1090 transitions. [2019-10-03 00:56:49,428 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 1090 transitions. Word has length 189 [2019-10-03 00:56:49,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:49,431 INFO L475 AbstractCegarLoop]: Abstraction has 843 states and 1090 transitions. [2019-10-03 00:56:49,431 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 00:56:49,431 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 1090 transitions. [2019-10-03 00:56:49,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-10-03 00:56:49,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:49,445 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:49,446 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:49,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:49,446 INFO L82 PathProgramCache]: Analyzing trace with hash 2063688929, now seen corresponding path program 1 times [2019-10-03 00:56:49,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:49,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:49,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:49,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:49,457 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:49,911 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-03 00:56:49,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 00:56:49,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 00:56:49,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:49,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 00:56:49,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 00:56:49,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 00:56:49,914 INFO L87 Difference]: Start difference. First operand 843 states and 1090 transitions. Second operand 3 states. [2019-10-03 00:56:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:49,970 INFO L93 Difference]: Finished difference Result 867 states and 1126 transitions. [2019-10-03 00:56:49,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 00:56:49,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 198 [2019-10-03 00:56:49,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:49,981 INFO L225 Difference]: With dead ends: 867 [2019-10-03 00:56:49,981 INFO L226 Difference]: Without dead ends: 867 [2019-10-03 00:56:49,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 00:56:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-10-03 00:56:50,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 845. [2019-10-03 00:56:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-10-03 00:56:50,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1092 transitions. [2019-10-03 00:56:50,040 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1092 transitions. Word has length 198 [2019-10-03 00:56:50,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:50,040 INFO L475 AbstractCegarLoop]: Abstraction has 845 states and 1092 transitions. [2019-10-03 00:56:50,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 00:56:50,041 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1092 transitions. [2019-10-03 00:56:50,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 00:56:50,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:50,047 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:50,048 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:50,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:50,048 INFO L82 PathProgramCache]: Analyzing trace with hash 313956321, now seen corresponding path program 1 times [2019-10-03 00:56:50,048 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:50,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:50,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:50,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:50,055 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:50,374 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-03 00:56:50,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 00:56:50,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 00:56:50,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:50,376 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 00:56:50,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 00:56:50,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 00:56:50,377 INFO L87 Difference]: Start difference. First operand 845 states and 1092 transitions. Second operand 5 states. [2019-10-03 00:56:50,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:50,437 INFO L93 Difference]: Finished difference Result 859 states and 1106 transitions. [2019-10-03 00:56:50,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 00:56:50,438 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-10-03 00:56:50,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:50,449 INFO L225 Difference]: With dead ends: 859 [2019-10-03 00:56:50,449 INFO L226 Difference]: Without dead ends: 859 [2019-10-03 00:56:50,450 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 00:56:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2019-10-03 00:56:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 859. [2019-10-03 00:56:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-10-03 00:56:50,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1106 transitions. [2019-10-03 00:56:50,490 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1106 transitions. Word has length 203 [2019-10-03 00:56:50,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:50,491 INFO L475 AbstractCegarLoop]: Abstraction has 859 states and 1106 transitions. [2019-10-03 00:56:50,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 00:56:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1106 transitions. [2019-10-03 00:56:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-03 00:56:50,500 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:50,500 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:50,502 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:50,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:50,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2042471678, now seen corresponding path program 1 times [2019-10-03 00:56:50,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:50,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:50,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:50,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:50,512 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:50,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:50,792 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-03 00:56:50,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 00:56:50,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 00:56:50,793 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:50,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 00:56:50,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 00:56:50,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 00:56:50,795 INFO L87 Difference]: Start difference. First operand 859 states and 1106 transitions. Second operand 3 states. [2019-10-03 00:56:50,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:50,841 INFO L93 Difference]: Finished difference Result 885 states and 1146 transitions. [2019-10-03 00:56:50,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 00:56:50,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 203 [2019-10-03 00:56:50,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:50,848 INFO L225 Difference]: With dead ends: 885 [2019-10-03 00:56:50,849 INFO L226 Difference]: Without dead ends: 885 [2019-10-03 00:56:50,849 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 00:56:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2019-10-03 00:56:50,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 885. [2019-10-03 00:56:50,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2019-10-03 00:56:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1146 transitions. [2019-10-03 00:56:50,945 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1146 transitions. Word has length 203 [2019-10-03 00:56:50,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:50,945 INFO L475 AbstractCegarLoop]: Abstraction has 885 states and 1146 transitions. [2019-10-03 00:56:50,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 00:56:50,946 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1146 transitions. [2019-10-03 00:56:50,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-03 00:56:50,955 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:50,955 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:50,956 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:50,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash -965558863, now seen corresponding path program 1 times [2019-10-03 00:56:50,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:50,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:50,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:50,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:50,966 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-03 00:56:51,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 00:56:51,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 00:56:51,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:51,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 00:56:51,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 00:56:51,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 00:56:51,279 INFO L87 Difference]: Start difference. First operand 885 states and 1146 transitions. Second operand 5 states. [2019-10-03 00:56:51,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:51,328 INFO L93 Difference]: Finished difference Result 903 states and 1170 transitions. [2019-10-03 00:56:51,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 00:56:51,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 213 [2019-10-03 00:56:51,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:51,336 INFO L225 Difference]: With dead ends: 903 [2019-10-03 00:56:51,336 INFO L226 Difference]: Without dead ends: 903 [2019-10-03 00:56:51,337 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 00:56:51,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-10-03 00:56:51,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 893. [2019-10-03 00:56:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 893 states. [2019-10-03 00:56:51,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1158 transitions. [2019-10-03 00:56:51,377 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1158 transitions. Word has length 213 [2019-10-03 00:56:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:51,378 INFO L475 AbstractCegarLoop]: Abstraction has 893 states and 1158 transitions. [2019-10-03 00:56:51,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 00:56:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1158 transitions. [2019-10-03 00:56:51,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-03 00:56:51,385 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:51,385 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:51,386 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:51,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:51,386 INFO L82 PathProgramCache]: Analyzing trace with hash -844920983, now seen corresponding path program 1 times [2019-10-03 00:56:51,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:51,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:51,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:51,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:51,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-03 00:56:51,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 00:56:51,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 00:56:51,649 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:51,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 00:56:51,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 00:56:51,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 00:56:51,651 INFO L87 Difference]: Start difference. First operand 893 states and 1158 transitions. Second operand 5 states. [2019-10-03 00:56:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:51,722 INFO L93 Difference]: Finished difference Result 961 states and 1256 transitions. [2019-10-03 00:56:51,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-03 00:56:51,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 218 [2019-10-03 00:56:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:51,729 INFO L225 Difference]: With dead ends: 961 [2019-10-03 00:56:51,730 INFO L226 Difference]: Without dead ends: 961 [2019-10-03 00:56:51,730 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 00:56:51,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2019-10-03 00:56:51,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 901. [2019-10-03 00:56:51,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 901 states. [2019-10-03 00:56:51,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1166 transitions. [2019-10-03 00:56:51,764 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1166 transitions. Word has length 218 [2019-10-03 00:56:51,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:51,765 INFO L475 AbstractCegarLoop]: Abstraction has 901 states and 1166 transitions. [2019-10-03 00:56:51,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 00:56:51,765 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1166 transitions. [2019-10-03 00:56:51,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2019-10-03 00:56:51,773 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:51,774 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:51,774 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:51,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash -1313253374, now seen corresponding path program 1 times [2019-10-03 00:56:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:51,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:51,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:51,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:51,781 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:52,263 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2019-10-03 00:56:52,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 00:56:52,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 00:56:52,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:52,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 00:56:52,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 00:56:52,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 00:56:52,267 INFO L87 Difference]: Start difference. First operand 901 states and 1166 transitions. Second operand 4 states. [2019-10-03 00:56:52,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:52,348 INFO L93 Difference]: Finished difference Result 947 states and 1236 transitions. [2019-10-03 00:56:52,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 00:56:52,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 321 [2019-10-03 00:56:52,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:52,359 INFO L225 Difference]: With dead ends: 947 [2019-10-03 00:56:52,359 INFO L226 Difference]: Without dead ends: 947 [2019-10-03 00:56:52,360 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 00:56:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-10-03 00:56:52,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 905. [2019-10-03 00:56:52,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2019-10-03 00:56:52,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1170 transitions. [2019-10-03 00:56:52,401 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1170 transitions. Word has length 321 [2019-10-03 00:56:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:52,402 INFO L475 AbstractCegarLoop]: Abstraction has 905 states and 1170 transitions. [2019-10-03 00:56:52,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 00:56:52,402 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1170 transitions. [2019-10-03 00:56:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-10-03 00:56:52,418 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:52,418 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:52,419 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1999079822, now seen corresponding path program 1 times [2019-10-03 00:56:52,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:52,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:52,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:52,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:52,427 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-03 00:56:52,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 00:56:52,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 00:56:52,791 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:52,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 00:56:52,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 00:56:52,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 00:56:52,793 INFO L87 Difference]: Start difference. First operand 905 states and 1170 transitions. Second operand 3 states. [2019-10-03 00:56:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:52,854 INFO L93 Difference]: Finished difference Result 915 states and 1182 transitions. [2019-10-03 00:56:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 00:56:52,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-10-03 00:56:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:52,861 INFO L225 Difference]: With dead ends: 915 [2019-10-03 00:56:52,862 INFO L226 Difference]: Without dead ends: 915 [2019-10-03 00:56:52,862 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 00:56:52,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2019-10-03 00:56:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 909. [2019-10-03 00:56:52,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-10-03 00:56:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1174 transitions. [2019-10-03 00:56:52,894 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1174 transitions. Word has length 332 [2019-10-03 00:56:52,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:52,895 INFO L475 AbstractCegarLoop]: Abstraction has 909 states and 1174 transitions. [2019-10-03 00:56:52,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 00:56:52,895 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1174 transitions. [2019-10-03 00:56:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-03 00:56:52,904 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:52,904 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:52,904 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:52,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:52,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1560753045, now seen corresponding path program 1 times [2019-10-03 00:56:52,905 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:52,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:52,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:52,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:52,911 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:53,366 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-10-03 00:56:53,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 00:56:53,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 00:56:53,367 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:53,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 00:56:53,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 00:56:53,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 00:56:53,369 INFO L87 Difference]: Start difference. First operand 909 states and 1174 transitions. Second operand 7 states. [2019-10-03 00:56:53,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:53,471 INFO L93 Difference]: Finished difference Result 943 states and 1222 transitions. [2019-10-03 00:56:53,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 00:56:53,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 343 [2019-10-03 00:56:53,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:53,482 INFO L225 Difference]: With dead ends: 943 [2019-10-03 00:56:53,482 INFO L226 Difference]: Without dead ends: 943 [2019-10-03 00:56:53,483 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 00:56:53,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-10-03 00:56:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 937. [2019-10-03 00:56:53,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-10-03 00:56:53,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1212 transitions. [2019-10-03 00:56:53,530 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1212 transitions. Word has length 343 [2019-10-03 00:56:53,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:53,531 INFO L475 AbstractCegarLoop]: Abstraction has 937 states and 1212 transitions. [2019-10-03 00:56:53,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 00:56:53,531 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1212 transitions. [2019-10-03 00:56:53,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2019-10-03 00:56:53,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 00:56:53,542 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 00:56:53,542 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 00:56:53,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:53,543 INFO L82 PathProgramCache]: Analyzing trace with hash 839833623, now seen corresponding path program 1 times [2019-10-03 00:56:53,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 00:56:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:53,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 00:56:53,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 00:56:53,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 00:56:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 00:56:54,048 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2019-10-03 00:56:54,048 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 00:56:54,048 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 00:56:54,050 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 344 with the following transitions: [2019-10-03 00:56:54,054 INFO L207 CegarAbsIntRunner]: [2], [4], [5], [6], [8], [9], [10], [11], [12], [13], [14], [16], [17], [24], [45], [47], [48], [122], [127], [133], [135], [136], [222], [234], [239], [269], [270], [271], [278], [279], [288], [290], [292], [295], [299], [303], [305], [306], [307], [308], [309], [310], [311], [312], [313], [315], [317], [320], [328], [330], [335], [342], [345], [359], [361], [363], [364], [436], [439], [441], [444], [446], [449], [495], [497], [504], [506], [508], [510], [512], [514], [516], [519], [522], [543], [556], [569], [582], [585], [588], [615], [618], [621], [633], [636], [639], [641], [644], [652], [689], [690], [769], [771], [773], [777], [781], [784], [786], [791], [795], [798], [802], [804], [809], [811], [831], [833], [835], [836], [837], [842], [845], [850], [852], [855], [872], [904], [905], [906], [907], [908], [910], [913], [931], [936], [937], [939], [940], [943], [945], [947], [948], [957], [978], [980], [983], [985], [989], [990], [991], [992], [1001], [1003], [1005], [1008], [1011], [1048], [1050], [1051], [1053], [1054], [1066], [1067], [1080], [1083], [1087], [1121], [1122], [1123], [1124], [1125], [1126], [1131], [1132], [1147], [1149], [1150], [1187], [1188], [1195], [1196], [1197], [1198], [1199], [1200], [1201], [1202], [1205], [1206], [1207], [1213], [1214], [1215], [1216], [1243], [1244], [1245], [1246], [1257], [1258], [1259], [1260], [1261], [1262], [1263], [1264], [1265], [1266], [1277], [1283], [1284], [1301], [1302], [1303], [1304], [1305], [1306], [1307], [1308], [1309], [1310], [1313], [1314], [1315], [1316], [1317], [1318], [1319], [1320], [1321], [1322], [1323], [1324], [1335], [1336], [1343], [1344], [1345], [1346], [1353], [1354], [1355], [1356], [1357], [1361], [1362], [1363], [1364], [1365], [1366], [1367], [1368], [1381], [1382], [1395], [1396], [1397] [2019-10-03 00:56:54,139 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 00:56:54,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 00:56:54,269 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 00:56:54,271 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 127 root evaluator evaluations with a maximum evaluation depth of 0. Performed 127 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 238 variables. [2019-10-03 00:56:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 00:56:54,278 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 00:56:54,411 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 00:56:54,412 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 00:56:54,431 INFO L420 sIntCurrentIteration]: We unified 342 AI predicates to 342 [2019-10-03 00:56:54,432 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 00:56:54,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 00:56:54,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2019-10-03 00:56:54,434 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 00:56:54,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 00:56:54,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 00:56:54,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 00:56:54,437 INFO L87 Difference]: Start difference. First operand 937 states and 1212 transitions. Second operand 2 states. [2019-10-03 00:56:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 00:56:54,438 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 00:56:54,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 00:56:54,439 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 343 [2019-10-03 00:56:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 00:56:54,440 INFO L225 Difference]: With dead ends: 2 [2019-10-03 00:56:54,440 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 00:56:54,441 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 00:56:54,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 00:56:54,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 00:56:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 00:56:54,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 00:56:54,443 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 343 [2019-10-03 00:56:54,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 00:56:54,444 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 00:56:54,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 00:56:54,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 00:56:54,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 00:56:54,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 12:56:54 BoogieIcfgContainer [2019-10-03 00:56:54,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 00:56:54,458 INFO L168 Benchmark]: Toolchain (without parser) took 14146.03 ms. Allocated memory was 132.1 MB in the beginning and 605.0 MB in the end (delta: 472.9 MB). Free memory was 81.9 MB in the beginning and 120.1 MB in the end (delta: -38.2 MB). Peak memory consumption was 434.7 MB. Max. memory is 7.1 GB. [2019-10-03 00:56:54,460 INFO L168 Benchmark]: CDTParser took 1.65 ms. Allocated memory is still 132.1 MB. Free memory was 106.2 MB in the beginning and 106.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-03 00:56:54,463 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1845.84 ms. Allocated memory was 132.1 MB in the beginning and 213.9 MB in the end (delta: 81.8 MB). Free memory was 81.7 MB in the beginning and 116.2 MB in the end (delta: -34.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. [2019-10-03 00:56:54,465 INFO L168 Benchmark]: Boogie Preprocessor took 351.02 ms. Allocated memory is still 213.9 MB. Free memory was 116.2 MB in the beginning and 102.4 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2019-10-03 00:56:54,474 INFO L168 Benchmark]: RCFGBuilder took 4481.66 ms. Allocated memory was 213.9 MB in the beginning and 278.9 MB in the end (delta: 65.0 MB). Free memory was 102.4 MB in the beginning and 69.4 MB in the end (delta: 33.0 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. [2019-10-03 00:56:54,476 INFO L168 Benchmark]: TraceAbstraction took 7461.74 ms. Allocated memory was 278.9 MB in the beginning and 605.0 MB in the end (delta: 326.1 MB). Free memory was 69.4 MB in the beginning and 120.1 MB in the end (delta: -50.7 MB). Peak memory consumption was 275.4 MB. Max. memory is 7.1 GB. [2019-10-03 00:56:54,490 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.65 ms. Allocated memory is still 132.1 MB. Free memory was 106.2 MB in the beginning and 106.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1845.84 ms. Allocated memory was 132.1 MB in the beginning and 213.9 MB in the end (delta: 81.8 MB). Free memory was 81.7 MB in the beginning and 116.2 MB in the end (delta: -34.5 MB). Peak memory consumption was 54.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 351.02 ms. Allocated memory is still 213.9 MB. Free memory was 116.2 MB in the beginning and 102.4 MB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4481.66 ms. Allocated memory was 213.9 MB in the beginning and 278.9 MB in the end (delta: 65.0 MB). Free memory was 102.4 MB in the beginning and 69.4 MB in the end (delta: 33.0 MB). Peak memory consumption was 101.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7461.74 ms. Allocated memory was 278.9 MB in the beginning and 605.0 MB in the end (delta: 326.1 MB). Free memory was 69.4 MB in the beginning and 120.1 MB in the end (delta: -50.7 MB). Peak memory consumption was 275.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3264]: 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 87 procedures, 663 locations, 1 error locations. SAFE Result, 7.3s OverallTime, 11 OverallIterations, 6 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7511 SDtfs, 538 SDslu, 15222 SDs, 0 SdLazy, 138 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=937occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.546783625730994 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 168 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2688 NumberOfCodeBlocks, 2688 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2677 ConstructedInterpolants, 0 QuantifiedInterpolants, 739679 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 1149/1162 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...