java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 18:49:38,121 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 18:49:38,124 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 18:49:38,141 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 18:49:38,141 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 18:49:38,143 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 18:49:38,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 18:49:38,154 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 18:49:38,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 18:49:38,160 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 18:49:38,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 18:49:38,164 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 18:49:38,164 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 18:49:38,166 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 18:49:38,167 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 18:49:38,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 18:49:38,169 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 18:49:38,170 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 18:49:38,171 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 18:49:38,173 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 18:49:38,174 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 18:49:38,175 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 18:49:38,176 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 18:49:38,177 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 18:49:38,178 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 18:49:38,179 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 18:49:38,179 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 18:49:38,179 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 18:49:38,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 18:49:38,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 18:49:38,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 18:49:38,182 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 18:49:38,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 18:49:38,183 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 18:49:38,184 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 18:49:38,184 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 18:49:38,185 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 18:49:38,185 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 18:49:38,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 18:49:38,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 18:49:38,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 18:49:38,187 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 18:49:38,208 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 18:49:38,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 18:49:38,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 18:49:38,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 18:49:38,213 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 18:49:38,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 18:49:38,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 18:49:38,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 18:49:38,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 18:49:38,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 18:49:38,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 18:49:38,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 18:49:38,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 18:49:38,215 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 18:49:38,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 18:49:38,215 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 18:49:38,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 18:49:38,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 18:49:38,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 18:49:38,216 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 18:49:38,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 18:49:38,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 18:49:38,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 18:49:38,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 18:49:38,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 18:49:38,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 18:49:38,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 18:49:38,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 18:49:38,221 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 18:49:38,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 18:49:38,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 18:49:38,263 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 18:49:38,264 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 18:49:38,265 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 18:49:38,265 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2019-09-08 18:49:38,318 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcde46bff/b092ac7cdaad4c9b9a09188d02e4f2f9/FLAGc6256be7c [2019-09-08 18:49:39,131 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 18:49:39,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2019-09-08 18:49:39,181 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcde46bff/b092ac7cdaad4c9b9a09188d02e4f2f9/FLAGc6256be7c [2019-09-08 18:49:39,623 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcde46bff/b092ac7cdaad4c9b9a09188d02e4f2f9 [2019-09-08 18:49:39,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 18:49:39,634 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 18:49:39,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 18:49:39,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 18:49:39,639 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 18:49:39,640 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:49:39" (1/1) ... [2019-09-08 18:49:39,643 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4752cb86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:39, skipping insertion in model container [2019-09-08 18:49:39,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 06:49:39" (1/1) ... [2019-09-08 18:49:39,651 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 18:49:39,798 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 18:49:42,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 18:49:42,264 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 18:49:42,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 18:49:42,931 INFO L192 MainTranslator]: Completed translation [2019-09-08 18:49:42,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:42 WrapperNode [2019-09-08 18:49:42,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 18:49:42,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 18:49:42,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 18:49:42,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 18:49:42,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:42" (1/1) ... [2019-09-08 18:49:42,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:42" (1/1) ... [2019-09-08 18:49:43,057 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:42" (1/1) ... [2019-09-08 18:49:43,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:42" (1/1) ... [2019-09-08 18:49:43,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:42" (1/1) ... [2019-09-08 18:49:43,300 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:42" (1/1) ... [2019-09-08 18:49:43,339 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:42" (1/1) ... [2019-09-08 18:49:43,385 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 18:49:43,386 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 18:49:43,386 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 18:49:43,386 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 18:49:43,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49: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-09-08 18:49:43,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 18:49:43,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 18:49:43,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2019-09-08 18:49:43,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2019-09-08 18:49:43,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 18:49:43,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~u32~0~X~~dma_addr_t~0~TO~VOID [2019-09-08 18:49:43,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-08 18:49:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-09-08 18:49:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-09-08 18:49:43,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-09-08 18:49:43,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-09-08 18:49:43,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-09-08 18:49:43,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-09-08 18:49:43,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-09-08 18:49:43,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 18:49:43,467 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2019-09-08 18:49:43,470 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2019-09-08 18:49:43,471 INFO L138 BoogieDeclarations]: Found implementation of procedure init_completion [2019-09-08 18:49:43,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-08 18:49:43,472 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-08 18:49:43,472 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-08 18:49:43,472 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-09-08 18:49:43,473 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_domain_nr [2019-09-08 18:49:43,473 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_dma_direction [2019-09-08 18:49:43,473 INFO L138 BoogieDeclarations]: Found implementation of procedure kmemcheck_mark_initialized [2019-09-08 18:49:43,473 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dma_ops [2019-09-08 18:49:43,473 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_map_single_attrs [2019-09-08 18:49:43,473 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_unmap_single_attrs [2019-09-08 18:49:43,473 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_alloc_consistent [2019-09-08 18:49:43,474 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_free_consistent [2019-09-08 18:49:43,474 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_map_single [2019-09-08 18:49:43,474 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_unmap_single [2019-09-08 18:49:43,474 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_get_drvdata [2019-09-08 18:49:43,474 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_ptr [2019-09-08 18:49:43,474 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-09-08 18:49:43,475 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-09-08 18:49:43,475 INFO L138 BoogieDeclarations]: Found implementation of procedure scsi_target [2019-09-08 18:49:43,475 INFO L138 BoogieDeclarations]: Found implementation of procedure shost_priv [2019-09-08 18:49:43,475 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_syscall_down [2019-09-08 18:49:43,475 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_reply [2019-09-08 18:49:43,475 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_taskmgmt_reply [2019-09-08 18:49:43,476 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_taskmgmt [2019-09-08 18:49:43,476 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_timeout_expired [2019-09-08 18:49:43,476 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_ioc_reset [2019-09-08 18:49:43,476 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_event_process [2019-09-08 18:49:43,476 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_fasync [2019-09-08 18:49:43,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __mptctl_ioctl [2019-09-08 18:49:43,477 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_ioctl [2019-09-08 18:49:43,477 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_reset [2019-09-08 18:49:43,477 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_fw_download [2019-09-08 18:49:43,477 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_fw_download [2019-09-08 18:49:43,477 INFO L138 BoogieDeclarations]: Found implementation of procedure kbuf_alloc_2_sgl [2019-09-08 18:49:43,477 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_sgl [2019-09-08 18:49:43,478 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_getiocinfo [2019-09-08 18:49:43,478 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_gettargetinfo [2019-09-08 18:49:43,478 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_readtest [2019-09-08 18:49:43,478 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_eventquery [2019-09-08 18:49:43,478 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_eventenable [2019-09-08 18:49:43,478 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_eventreport [2019-09-08 18:49:43,478 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_replace_fw [2019-09-08 18:49:43,479 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_mpt_command [2019-09-08 18:49:43,479 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_do_mpt_command [2019-09-08 18:49:43,479 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_hp_hostinfo [2019-09-08 18:49:43,479 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_hp_targetinfo [2019-09-08 18:49:43,479 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_mptfwxfer_ioctl [2019-09-08 18:49:43,479 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_mpt_command [2019-09-08 18:49:43,480 INFO L138 BoogieDeclarations]: Found implementation of procedure compat_mpctl_ioctl [2019-09-08 18:49:43,480 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_probe [2019-09-08 18:49:43,480 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_remove [2019-09-08 18:49:43,480 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_init [2019-09-08 18:49:43,480 INFO L138 BoogieDeclarations]: Found implementation of procedure mptctl_exit [2019-09-08 18:49:43,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_file_operations_2 [2019-09-08 18:49:43,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize_mpt_pci_driver_1 [2019-09-08 18:49:43,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 18:49:43,481 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-09-08 18:49:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-09-08 18:49:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_5 [2019-09-08 18:49:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_6 [2019-09-08 18:49:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_7 [2019-09-08 18:49:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_8 [2019-09-08 18:49:43,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-09-08 18:49:43,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_10 [2019-09-08 18:49:43,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_11 [2019-09-08 18:49:43,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_12 [2019-09-08 18:49:43,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_13 [2019-09-08 18:49:43,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_14 [2019-09-08 18:49:43,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_15 [2019-09-08 18:49:43,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_16 [2019-09-08 18:49:43,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_17 [2019-09-08 18:49:43,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_18 [2019-09-08 18:49:43,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_19 [2019-09-08 18:49:43,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_20 [2019-09-08 18:49:43,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_21 [2019-09-08 18:49:43,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_22 [2019-09-08 18:49:43,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_23 [2019-09-08 18:49:43,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_24 [2019-09-08 18:49:43,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_25 [2019-09-08 18:49:43,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_26 [2019-09-08 18:49:43,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_27 [2019-09-08 18:49:43,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_28 [2019-09-08 18:49:43,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_29 [2019-09-08 18:49:43,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_30 [2019-09-08 18:49:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_31 [2019-09-08 18:49:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_register_32 [2019-09-08 18:49:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_deregister_33 [2019-09-08 18:49:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_deregister_34 [2019-09-08 18:49:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_misc_deregister_35 [2019-09-08 18:49:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 18:49:43,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2019-09-08 18:49:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-09-08 18:49:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-09-08 18:49:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-09-08 18:49:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-09-08 18:49:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_i_mutex_of_inode [2019-09-08 18:49:43,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_i_mutex_of_inode [2019-09-08 18:49:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_i_mutex_of_inode [2019-09-08 18:49:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_i_mutex_of_inode [2019-09-08 18:49:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_i_mutex_of_inode [2019-09-08 18:49:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_i_mutex_of_inode [2019-09-08 18:49:43,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_i_mutex_of_inode [2019-09-08 18:49:43,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_i_mutex_of_inode [2019-09-08 18:49:43,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_i_mutex_of_inode [2019-09-08 18:49:43,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_i_mutex_of_inode [2019-09-08 18:49:43,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_i_mutex_of_inode [2019-09-08 18:49:43,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-09-08 18:49:43,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-09-08 18:49:43,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-09-08 18:49:43,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-09-08 18:49:43,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-08 18:49:43,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-09-08 18:49:43,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-09-08 18:49:43,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_lock [2019-09-08 18:49:43,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_lock [2019-09-08 18:49:43,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_lock [2019-09-08 18:49:43,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_lock [2019-09-08 18:49:43,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mpctl_mutex [2019-09-08 18:49:43,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mpctl_mutex [2019-09-08 18:49:43,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mpctl_mutex [2019-09-08 18:49:43,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mpctl_mutex [2019-09-08 18:49:43,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mpctl_mutex [2019-09-08 18:49:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mpctl_mutex [2019-09-08 18:49:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mpctl_mutex [2019-09-08 18:49:43,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mpctl_mutex [2019-09-08 18:49:43,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mpctl_mutex [2019-09-08 18:49:43,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mpctl_mutex [2019-09-08 18:49:43,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mpctl_mutex [2019-09-08 18:49:43,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of__MPT_MGMT [2019-09-08 18:49:43,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of__MPT_MGMT [2019-09-08 18:49:43,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of__MPT_MGMT [2019-09-08 18:49:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of__MPT_MGMT [2019-09-08 18:49:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of__MPT_MGMT [2019-09-08 18:49:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of__MPT_MGMT [2019-09-08 18:49:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of__MPT_MGMT [2019-09-08 18:49:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mutex_of__MPT_MGMT [2019-09-08 18:49:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mutex_of__MPT_MGMT [2019-09-08 18:49:43,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mutex_of__MPT_MGMT [2019-09-08 18:49:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mutex_of__MPT_MGMT [2019-09-08 18:49:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-08 18:49:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-08 18:49:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-09-08 18:49:43,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-09-08 18:49:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-08 18:49:43,508 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-08 18:49:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-09-08 18:49:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mutex_of_device [2019-09-08 18:49:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mutex_of_device [2019-09-08 18:49:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-09-08 18:49:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mutex_of_device [2019-09-08 18:49:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 18:49:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_from_user_overflow [2019-09-08 18:49:43,509 INFO L138 BoogieDeclarations]: Found implementation of procedure __copy_to_user_overflow [2019-09-08 18:49:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2019-09-08 18:49:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_fault [2019-09-08 18:49:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-09-08 18:49:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __phys_addr [2019-09-08 18:49:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure __scsi_iterate_devices [2019-09-08 18:49:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-09-08 18:49:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-09-08 18:49:43,510 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2019-09-08 18:49:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_unlock_irqrestore [2019-09-08 18:49:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure complete [2019-09-08 18:49:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_map_page [2019-09-08 18:49:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_dma_unmap_page [2019-09-08 18:49:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_alloc_attrs [2019-09-08 18:49:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure dma_free_attrs [2019-09-08 18:49:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure fasync_helper [2019-09-08 18:49:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_fasync [2019-09-08 18:49:43,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 18:49:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_open_2 [2019-09-08 18:49:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_release_2 [2019-09-08 18:49:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure memdup_user [2019-09-08 18:49:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_deregister [2019-09-08 18:49:43,512 INFO L138 BoogieDeclarations]: Found implementation of procedure misc_register [2019-09-08 18:49:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_GetIocState [2019-09-08 18:49:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_HardResetHandler [2019-09-08 18:49:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_Soft_Hard_ResetHandler [2019-09-08 18:49:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_alloc_fw_memory [2019-09-08 18:49:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_clear_taskmgmt_in_progress_flag [2019-09-08 18:49:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_config [2019-09-08 18:49:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_deregister [2019-09-08 18:49:43,513 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_device_driver_deregister [2019-09-08 18:49:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_device_driver_register [2019-09-08 18:49:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_event_deregister [2019-09-08 18:49:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_event_register [2019-09-08 18:49:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_free_fw_memory [2019-09-08 18:49:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_free_msg_frame [2019-09-08 18:49:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_get_msg_frame [2019-09-08 18:49:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_halt_firmware [2019-09-08 18:49:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_put_msg_frame [2019-09-08 18:49:43,514 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_put_msg_frame_hi_pri [2019-09-08 18:49:43,515 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_register [2019-09-08 18:49:43,515 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_reset_deregister [2019-09-08 18:49:43,515 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_reset_register [2019-09-08 18:49:43,515 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_send_handshake_request [2019-09-08 18:49:43,515 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_set_taskmgmt_in_progress_flag [2019-09-08 18:49:43,515 INFO L138 BoogieDeclarations]: Found implementation of procedure mpt_verify_adapter [2019-09-08 18:49:43,515 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-09-08 18:49:43,515 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock_interruptible [2019-09-08 18:49:43,516 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-09-08 18:49:43,516 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-09-08 18:49:43,516 INFO L138 BoogieDeclarations]: Found implementation of procedure no_llseek [2019-09-08 18:49:43,516 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 18:49:43,516 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2019-09-08 18:49:43,516 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 18:49:43,516 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 18:49:43,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-08 18:49:43,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-09-08 18:49:43,517 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-09-08 18:49:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 18:49:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 18:49:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 18:49:43,517 INFO L130 BoogieDeclarations]: Found specification of procedure __might_fault [2019-09-08 18:49:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-09-08 18:49:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-09-08 18:49:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure __phys_addr [2019-09-08 18:49:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure memdup_user [2019-09-08 18:49:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-09-08 18:49:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-08 18:49:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-09-08 18:49:43,518 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-09-08 18:49:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-09-08 18:49:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-09-08 18:49:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-09-08 18:49:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-09-08 18:49:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_8 [2019-09-08 18:49:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_12 [2019-09-08 18:49:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-09-08 18:49:43,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_6 [2019-09-08 18:49:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-09-08 18:49:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_10 [2019-09-08 18:49:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_15 [2019-09-08 18:49:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_16 [2019-09-08 18:49:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_18 [2019-09-08 18:49:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_19 [2019-09-08 18:49:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_21 [2019-09-08 18:49:43,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_23 [2019-09-08 18:49:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_24 [2019-09-08 18:49:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_25 [2019-09-08 18:49:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_26 [2019-09-08 18:49:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_27 [2019-09-08 18:49:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_28 [2019-09-08 18:49:43,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_29 [2019-09-08 18:49:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_31 [2019-09-08 18:49:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 18:49:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 18:49:43,522 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 18:49:43,523 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-08 18:49:43,526 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 18:49:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 18:49:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-08 18:49:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 18:49:43,527 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-09-08 18:49:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-09-08 18:49:43,529 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-09-08 18:49:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-09-08 18:49:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-08 18:49:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-09-08 18:49:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-09-08 18:49:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-09-08 18:49:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-09-08 18:49:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock_interruptible [2019-09-08 18:49:43,530 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_13 [2019-09-08 18:49:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-09-08 18:49:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_5 [2019-09-08 18:49:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_7 [2019-09-08 18:49:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_11 [2019-09-08 18:49:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_14 [2019-09-08 18:49:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_17 [2019-09-08 18:49:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_20 [2019-09-08 18:49:43,531 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_22 [2019-09-08 18:49:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_30 [2019-09-08 18:49:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_i_mutex_of_inode [2019-09-08 18:49:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_i_mutex_of_inode [2019-09-08 18:49:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-09-08 18:49:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-09-08 18:49:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mpctl_mutex [2019-09-08 18:49:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mpctl_mutex [2019-09-08 18:49:43,532 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of__MPT_MGMT [2019-09-08 18:49:43,533 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of__MPT_MGMT [2019-09-08 18:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of__MPT_MGMT [2019-09-08 18:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of__MPT_MGMT [2019-09-08 18:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-09-08 18:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-09-08 18:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-09-08 18:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2019-09-08 18:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_unlock_irqrestore [2019-09-08 18:49:43,534 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2019-09-08 18:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2019-09-08 18:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2019-09-08 18:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure init_completion [2019-09-08 18:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 18:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 18:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 18:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2019-09-08 18:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure complete [2019-09-08 18:49:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 18:49:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-08 18:49:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-08 18:49:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-08 18:49:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_file_operations_2 [2019-09-08 18:49:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize_mpt_pci_driver_1 [2019-09-08 18:49:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-09-08 18:49:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 18:49:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure pci_domain_nr [2019-09-08 18:49:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 18:49:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure valid_dma_direction [2019-09-08 18:49:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure kmemcheck_mark_initialized [2019-09-08 18:49:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_map_page [2019-09-08 18:49:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure debug_dma_unmap_page [2019-09-08 18:49:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure get_dma_ops [2019-09-08 18:49:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure dma_map_single_attrs [2019-09-08 18:49:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~int~X~int~X~$Pointer$~TO~~dma_addr_t~0 [2019-09-08 18:49:43,537 INFO L130 BoogieDeclarations]: Found specification of procedure dma_unmap_single_attrs [2019-09-08 18:49:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~dma_addr_t~0~X~int~X~int~X~$Pointer$~TO~VOID [2019-09-08 18:49:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure dma_alloc_attrs [2019-09-08 18:49:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure dma_free_attrs [2019-09-08 18:49:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure pci_alloc_consistent [2019-09-08 18:49:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure pci_free_consistent [2019-09-08 18:49:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure pci_map_single [2019-09-08 18:49:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure pci_unmap_single [2019-09-08 18:49:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure pci_get_drvdata [2019-09-08 18:49:43,538 INFO L130 BoogieDeclarations]: Found specification of procedure misc_register [2019-09-08 18:49:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_register_32 [2019-09-08 18:49:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure misc_deregister [2019-09-08 18:49:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_deregister_33 [2019-09-08 18:49:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_deregister_34 [2019-09-08 18:49:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_misc_deregister_35 [2019-09-08 18:49:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure fasync_helper [2019-09-08 18:49:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure kill_fasync [2019-09-08 18:49:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure no_llseek [2019-09-08 18:49:43,539 INFO L130 BoogieDeclarations]: Found specification of procedure compat_ptr [2019-09-08 18:49:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-09-08 18:49:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-09-08 18:49:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_from_user_overflow [2019-09-08 18:49:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure __copy_to_user_overflow [2019-09-08 18:49:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-09-08 18:49:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-09-08 18:49:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure scsi_target [2019-09-08 18:49:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure __scsi_iterate_devices [2019-09-08 18:49:43,540 INFO L130 BoogieDeclarations]: Found specification of procedure shost_priv [2019-09-08 18:49:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_register [2019-09-08 18:49:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_deregister [2019-09-08 18:49:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_event_register [2019-09-08 18:49:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_event_deregister [2019-09-08 18:49:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_reset_register [2019-09-08 18:49:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_reset_deregister [2019-09-08 18:49:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_device_driver_register [2019-09-08 18:49:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_device_driver_deregister [2019-09-08 18:49:43,541 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_get_msg_frame [2019-09-08 18:49:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_free_msg_frame [2019-09-08 18:49:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_put_msg_frame [2019-09-08 18:49:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_put_msg_frame_hi_pri [2019-09-08 18:49:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_send_handshake_request [2019-09-08 18:49:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_verify_adapter [2019-09-08 18:49:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_GetIocState [2019-09-08 18:49:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_HardResetHandler [2019-09-08 18:49:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_Soft_Hard_ResetHandler [2019-09-08 18:49:43,542 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_config [2019-09-08 18:49:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_alloc_fw_memory [2019-09-08 18:49:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_free_fw_memory [2019-09-08 18:49:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_set_taskmgmt_in_progress_flag [2019-09-08 18:49:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_clear_taskmgmt_in_progress_flag [2019-09-08 18:49:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mpt_halt_firmware [2019-09-08 18:49:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_fw_download [2019-09-08 18:49:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_getiocinfo [2019-09-08 18:49:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_gettargetinfo [2019-09-08 18:49:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_readtest [2019-09-08 18:49:43,543 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_mpt_command [2019-09-08 18:49:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_eventquery [2019-09-08 18:49:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_eventenable [2019-09-08 18:49:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_eventreport [2019-09-08 18:49:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_replace_fw [2019-09-08 18:49:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_reset [2019-09-08 18:49:43,544 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_hp_hostinfo [2019-09-08 18:49:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_hp_targetinfo [2019-09-08 18:49:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_probe [2019-09-08 18:49:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_remove [2019-09-08 18:49:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure compat_mpctl_ioctl [2019-09-08 18:49:43,546 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_mpt_command [2019-09-08 18:49:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_fw_download [2019-09-08 18:49:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure kbuf_alloc_2_sgl [2019-09-08 18:49:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_sgl [2019-09-08 18:49:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_ioc_reset [2019-09-08 18:49:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_event_process [2019-09-08 18:49:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_syscall_down [2019-09-08 18:49:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_reply [2019-09-08 18:49:43,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-09-08 18:49:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-09-08 18:49:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 18:49:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_taskmgmt_reply [2019-09-08 18:49:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_do_taskmgmt [2019-09-08 18:49:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_timeout_expired [2019-09-08 18:49:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_fasync [2019-09-08 18:49:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure __mptctl_ioctl [2019-09-08 18:49:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_ioctl [2019-09-08 18:49:43,548 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~u32~0~X~~dma_addr_t~0~TO~VOID [2019-09-08 18:49:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure compat_mptfwxfer_ioctl [2019-09-08 18:49:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure compat_mpt_command [2019-09-08 18:49:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_init [2019-09-08 18:49:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure mptctl_exit [2019-09-08 18:49:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_open_2 [2019-09-08 18:49:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 18:49:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_release_2 [2019-09-08 18:49:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 18:49:43,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 18:49:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 18:49:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2019-09-08 18:49:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-09-08 18:49:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-09-08 18:49:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_i_mutex_of_inode [2019-09-08 18:49:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_i_mutex_of_inode [2019-09-08 18:49:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_i_mutex_of_inode [2019-09-08 18:49:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_i_mutex_of_inode [2019-09-08 18:49:43,550 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_i_mutex_of_inode [2019-09-08 18:49:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_i_mutex_of_inode [2019-09-08 18:49:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_i_mutex_of_inode [2019-09-08 18:49:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_i_mutex_of_inode [2019-09-08 18:49:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_i_mutex_of_inode [2019-09-08 18:49:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-09-08 18:49:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-09-08 18:49:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-09-08 18:49:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-08 18:49:43,551 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-09-08 18:49:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_lock [2019-09-08 18:49:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_lock [2019-09-08 18:49:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_lock [2019-09-08 18:49:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_lock [2019-09-08 18:49:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mpctl_mutex [2019-09-08 18:49:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mpctl_mutex [2019-09-08 18:49:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mpctl_mutex [2019-09-08 18:49:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mpctl_mutex [2019-09-08 18:49:43,552 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mpctl_mutex [2019-09-08 18:49:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mpctl_mutex [2019-09-08 18:49:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mpctl_mutex [2019-09-08 18:49:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mpctl_mutex [2019-09-08 18:49:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mpctl_mutex [2019-09-08 18:49:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of__MPT_MGMT [2019-09-08 18:49:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of__MPT_MGMT [2019-09-08 18:49:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of__MPT_MGMT [2019-09-08 18:49:43,553 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mutex_of__MPT_MGMT [2019-09-08 18:49:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mutex_of__MPT_MGMT [2019-09-08 18:49:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mutex_of__MPT_MGMT [2019-09-08 18:49:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mutex_of__MPT_MGMT [2019-09-08 18:49:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-08 18:49:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-08 18:49:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-08 18:49:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-08 18:49:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mutex_of_device [2019-09-08 18:49:43,554 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mutex_of_device [2019-09-08 18:49:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-09-08 18:49:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mutex_of_device [2019-09-08 18:49:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 18:49:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-08 18:49:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 18:49:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-08 18:49:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 18:49:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 18:49:43,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 18:49:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 18:49:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 18:49:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-09-08 18:49:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-09-08 18:49:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2019-09-08 18:49:43,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2019-09-08 18:49:45,067 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-09-08 18:57:57,757 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 18:57:57,758 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 18:57:57,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:57:57 BoogieIcfgContainer [2019-09-08 18:57:57,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 18:57:57,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 18:57:57,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 18:57:57,764 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 18:57:57,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 06:49:39" (1/3) ... [2019-09-08 18:57:57,765 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f20bed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:57:57, skipping insertion in model container [2019-09-08 18:57:57,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 06:49:42" (2/3) ... [2019-09-08 18:57:57,766 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f20bed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 06:57:57, skipping insertion in model container [2019-09-08 18:57:57,766 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 06:57:57" (3/3) ... [2019-09-08 18:57:57,767 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--message--fusion--mptctl.ko-entry_point.cil.out.i [2019-09-08 18:57:57,777 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 18:57:57,786 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 18:57:57,802 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 18:57:57,840 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 18:57:57,840 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 18:57:57,841 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 18:57:57,841 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 18:57:57,841 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 18:57:57,841 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 18:57:57,841 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 18:57:57,841 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 18:57:57,841 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 18:57:57,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1942 states. [2019-09-08 18:57:57,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 18:57:57,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:57:57,900 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:57:57,902 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:57:57,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:57:57,908 INFO L82 PathProgramCache]: Analyzing trace with hash 768654635, now seen corresponding path program 1 times [2019-09-08 18:57:57,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:57:57,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:57:57,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:57:57,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:57:57,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:57:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:57:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-09-08 18:57:58,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:57:58,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:57:58,899 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:57:58,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:57:58,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:57:58,916 INFO L87 Difference]: Start difference. First operand 1942 states. Second operand 3 states. [2019-09-08 18:58:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:00,185 INFO L93 Difference]: Finished difference Result 3413 states and 4717 transitions. [2019-09-08 18:58:00,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:00,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-09-08 18:58:00,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:00,235 INFO L225 Difference]: With dead ends: 3413 [2019-09-08 18:58:00,236 INFO L226 Difference]: Without dead ends: 1762 [2019-09-08 18:58:00,252 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:00,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1762 states. [2019-09-08 18:58:00,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1762 to 1734. [2019-09-08 18:58:00,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1734 states. [2019-09-08 18:58:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2340 transitions. [2019-09-08 18:58:00,489 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2340 transitions. Word has length 123 [2019-09-08 18:58:00,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:00,490 INFO L475 AbstractCegarLoop]: Abstraction has 1734 states and 2340 transitions. [2019-09-08 18:58:00,490 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2340 transitions. [2019-09-08 18:58:00,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 18:58:00,507 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:00,508 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:00,508 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:00,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:00,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1340720802, now seen corresponding path program 1 times [2019-09-08 18:58:00,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:00,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:00,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:00,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:00,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-09-08 18:58:00,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:00,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:00,928 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:00,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:00,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:00,928 INFO L87 Difference]: Start difference. First operand 1734 states and 2340 transitions. Second operand 3 states. [2019-09-08 18:58:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:04,275 INFO L93 Difference]: Finished difference Result 4976 states and 6759 transitions. [2019-09-08 18:58:04,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:04,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-09-08 18:58:04,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:04,296 INFO L225 Difference]: With dead ends: 4976 [2019-09-08 18:58:04,297 INFO L226 Difference]: Without dead ends: 3286 [2019-09-08 18:58:04,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:04,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3286 states. [2019-09-08 18:58:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3286 to 3270. [2019-09-08 18:58:04,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3270 states. [2019-09-08 18:58:04,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3270 states to 3270 states and 4448 transitions. [2019-09-08 18:58:04,452 INFO L78 Accepts]: Start accepts. Automaton has 3270 states and 4448 transitions. Word has length 151 [2019-09-08 18:58:04,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:04,453 INFO L475 AbstractCegarLoop]: Abstraction has 3270 states and 4448 transitions. [2019-09-08 18:58:04,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3270 states and 4448 transitions. [2019-09-08 18:58:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 18:58:04,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:04,455 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:04,456 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:04,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:04,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1498035074, now seen corresponding path program 1 times [2019-09-08 18:58:04,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:04,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:04,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:04,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-08 18:58:04,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:04,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:04,877 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:04,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:04,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:04,878 INFO L87 Difference]: Start difference. First operand 3270 states and 4448 transitions. Second operand 3 states. [2019-09-08 18:58:04,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:04,980 INFO L93 Difference]: Finished difference Result 3272 states and 4449 transitions. [2019-09-08 18:58:04,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:04,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 18:58:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:05,005 INFO L225 Difference]: With dead ends: 3272 [2019-09-08 18:58:05,005 INFO L226 Difference]: Without dead ends: 3269 [2019-09-08 18:58:05,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-09-08 18:58:05,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3269. [2019-09-08 18:58:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-09-08 18:58:05,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 4446 transitions. [2019-09-08 18:58:05,187 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 4446 transitions. Word has length 171 [2019-09-08 18:58:05,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:05,188 INFO L475 AbstractCegarLoop]: Abstraction has 3269 states and 4446 transitions. [2019-09-08 18:58:05,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:05,188 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 4446 transitions. [2019-09-08 18:58:05,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 18:58:05,191 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:05,191 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:05,191 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:05,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:05,192 INFO L82 PathProgramCache]: Analyzing trace with hash 804858022, now seen corresponding path program 1 times [2019-09-08 18:58:05,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:05,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:05,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:05,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:05,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-08 18:58:05,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:05,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:05,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:05,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:05,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:05,588 INFO L87 Difference]: Start difference. First operand 3269 states and 4446 transitions. Second operand 3 states. [2019-09-08 18:58:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:05,734 INFO L93 Difference]: Finished difference Result 3271 states and 4447 transitions. [2019-09-08 18:58:05,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:05,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 18:58:05,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:05,757 INFO L225 Difference]: With dead ends: 3271 [2019-09-08 18:58:05,757 INFO L226 Difference]: Without dead ends: 3268 [2019-09-08 18:58:05,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:05,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3268 states. [2019-09-08 18:58:05,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3268 to 3268. [2019-09-08 18:58:05,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3268 states. [2019-09-08 18:58:05,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 4444 transitions. [2019-09-08 18:58:05,917 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 4444 transitions. Word has length 172 [2019-09-08 18:58:05,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:05,920 INFO L475 AbstractCegarLoop]: Abstraction has 3268 states and 4444 transitions. [2019-09-08 18:58:05,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 4444 transitions. [2019-09-08 18:58:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 18:58:05,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:05,923 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:05,924 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:05,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:05,924 INFO L82 PathProgramCache]: Analyzing trace with hash -819895167, now seen corresponding path program 1 times [2019-09-08 18:58:05,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:05,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:05,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:05,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:05,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:06,221 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-08 18:58:06,221 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:06,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:06,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:06,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:06,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:06,223 INFO L87 Difference]: Start difference. First operand 3268 states and 4444 transitions. Second operand 3 states. [2019-09-08 18:58:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:06,310 INFO L93 Difference]: Finished difference Result 3278 states and 4450 transitions. [2019-09-08 18:58:06,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:06,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 173 [2019-09-08 18:58:06,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:06,332 INFO L225 Difference]: With dead ends: 3278 [2019-09-08 18:58:06,332 INFO L226 Difference]: Without dead ends: 3274 [2019-09-08 18:58:06,335 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3274 states. [2019-09-08 18:58:06,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3274 to 3272. [2019-09-08 18:58:06,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3272 states. [2019-09-08 18:58:06,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3272 states to 3272 states and 4443 transitions. [2019-09-08 18:58:06,468 INFO L78 Accepts]: Start accepts. Automaton has 3272 states and 4443 transitions. Word has length 173 [2019-09-08 18:58:06,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:06,469 INFO L475 AbstractCegarLoop]: Abstraction has 3272 states and 4443 transitions. [2019-09-08 18:58:06,469 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:06,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3272 states and 4443 transitions. [2019-09-08 18:58:06,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 18:58:06,471 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:06,472 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:06,472 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:06,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:06,472 INFO L82 PathProgramCache]: Analyzing trace with hash 352368393, now seen corresponding path program 1 times [2019-09-08 18:58:06,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:06,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:06,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:06,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:06,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-08 18:58:06,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:06,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:06,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:06,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:06,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:06,739 INFO L87 Difference]: Start difference. First operand 3272 states and 4443 transitions. Second operand 3 states. [2019-09-08 18:58:06,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:06,965 INFO L93 Difference]: Finished difference Result 9398 states and 12907 transitions. [2019-09-08 18:58:06,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:06,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 18:58:06,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:07,004 INFO L225 Difference]: With dead ends: 9398 [2019-09-08 18:58:07,005 INFO L226 Difference]: Without dead ends: 6170 [2019-09-08 18:58:07,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6170 states. [2019-09-08 18:58:07,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6170 to 6138. [2019-09-08 18:58:07,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6138 states. [2019-09-08 18:58:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6138 states to 6138 states and 8422 transitions. [2019-09-08 18:58:07,913 INFO L78 Accepts]: Start accepts. Automaton has 6138 states and 8422 transitions. Word has length 174 [2019-09-08 18:58:07,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:07,913 INFO L475 AbstractCegarLoop]: Abstraction has 6138 states and 8422 transitions. [2019-09-08 18:58:07,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:07,913 INFO L276 IsEmpty]: Start isEmpty. Operand 6138 states and 8422 transitions. [2019-09-08 18:58:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 18:58:07,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:07,916 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:07,916 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:07,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:07,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1962162044, now seen corresponding path program 1 times [2019-09-08 18:58:07,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:07,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:07,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:07,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:07,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:08,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:08,204 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-08 18:58:08,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:08,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:08,205 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:08,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:08,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:08,206 INFO L87 Difference]: Start difference. First operand 6138 states and 8422 transitions. Second operand 3 states. [2019-09-08 18:58:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:08,349 INFO L93 Difference]: Finished difference Result 6140 states and 8423 transitions. [2019-09-08 18:58:08,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:08,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2019-09-08 18:58:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:08,386 INFO L225 Difference]: With dead ends: 6140 [2019-09-08 18:58:08,386 INFO L226 Difference]: Without dead ends: 6100 [2019-09-08 18:58:08,391 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:08,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6100 states. [2019-09-08 18:58:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6100 to 6100. [2019-09-08 18:58:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6100 states. [2019-09-08 18:58:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6100 states to 6100 states and 8376 transitions. [2019-09-08 18:58:08,666 INFO L78 Accepts]: Start accepts. Automaton has 6100 states and 8376 transitions. Word has length 175 [2019-09-08 18:58:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:08,666 INFO L475 AbstractCegarLoop]: Abstraction has 6100 states and 8376 transitions. [2019-09-08 18:58:08,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 6100 states and 8376 transitions. [2019-09-08 18:58:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 18:58:08,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:08,672 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:08,672 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1614725740, now seen corresponding path program 1 times [2019-09-08 18:58:08,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:08,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:08,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:08,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:08,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:08,961 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-08 18:58:08,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:08,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:08,962 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:08,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:08,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:08,963 INFO L87 Difference]: Start difference. First operand 6100 states and 8376 transitions. Second operand 3 states. [2019-09-08 18:58:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:12,518 INFO L93 Difference]: Finished difference Result 9334 states and 12769 transitions. [2019-09-08 18:58:12,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:12,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-09-08 18:58:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:12,551 INFO L225 Difference]: With dead ends: 9334 [2019-09-08 18:58:12,551 INFO L226 Difference]: Without dead ends: 3276 [2019-09-08 18:58:12,575 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:12,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3276 states. [2019-09-08 18:58:12,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3276 to 3267. [2019-09-08 18:58:12,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3267 states. [2019-09-08 18:58:12,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3267 states to 3267 states and 4431 transitions. [2019-09-08 18:58:12,696 INFO L78 Accepts]: Start accepts. Automaton has 3267 states and 4431 transitions. Word has length 205 [2019-09-08 18:58:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:12,696 INFO L475 AbstractCegarLoop]: Abstraction has 3267 states and 4431 transitions. [2019-09-08 18:58:12,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:12,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3267 states and 4431 transitions. [2019-09-08 18:58:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-09-08 18:58:12,701 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:12,701 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:12,701 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:12,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:12,702 INFO L82 PathProgramCache]: Analyzing trace with hash -497281246, now seen corresponding path program 1 times [2019-09-08 18:58:12,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:12,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:12,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:13,043 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2019-09-08 18:58:13,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:13,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:13,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:13,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:13,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:13,047 INFO L87 Difference]: Start difference. First operand 3267 states and 4431 transitions. Second operand 3 states. [2019-09-08 18:58:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:16,785 INFO L93 Difference]: Finished difference Result 6702 states and 9075 transitions. [2019-09-08 18:58:16,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:16,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 210 [2019-09-08 18:58:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:16,822 INFO L225 Difference]: With dead ends: 6702 [2019-09-08 18:58:16,822 INFO L226 Difference]: Without dead ends: 3535 [2019-09-08 18:58:16,841 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:16,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3535 states. [2019-09-08 18:58:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3535 to 3489. [2019-09-08 18:58:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3489 states. [2019-09-08 18:58:17,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3489 states to 3489 states and 4694 transitions. [2019-09-08 18:58:17,026 INFO L78 Accepts]: Start accepts. Automaton has 3489 states and 4694 transitions. Word has length 210 [2019-09-08 18:58:17,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:17,029 INFO L475 AbstractCegarLoop]: Abstraction has 3489 states and 4694 transitions. [2019-09-08 18:58:17,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:17,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3489 states and 4694 transitions. [2019-09-08 18:58:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 18:58:17,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:17,035 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:17,036 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:17,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:17,036 INFO L82 PathProgramCache]: Analyzing trace with hash -1321483025, now seen corresponding path program 1 times [2019-09-08 18:58:17,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:17,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:17,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:17,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:17,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:17,466 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-09-08 18:58:17,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:17,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:17,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:17,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:17,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:17,468 INFO L87 Difference]: Start difference. First operand 3489 states and 4694 transitions. Second operand 3 states. [2019-09-08 18:58:21,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:21,051 INFO L93 Difference]: Finished difference Result 3493 states and 4696 transitions. [2019-09-08 18:58:21,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:21,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-09-08 18:58:21,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:21,065 INFO L225 Difference]: With dead ends: 3493 [2019-09-08 18:58:21,065 INFO L226 Difference]: Without dead ends: 3490 [2019-09-08 18:58:21,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:21,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2019-09-08 18:58:21,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 3488. [2019-09-08 18:58:21,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3488 states. [2019-09-08 18:58:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3488 states to 3488 states and 4689 transitions. [2019-09-08 18:58:21,295 INFO L78 Accepts]: Start accepts. Automaton has 3488 states and 4689 transitions. Word has length 209 [2019-09-08 18:58:21,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:21,296 INFO L475 AbstractCegarLoop]: Abstraction has 3488 states and 4689 transitions. [2019-09-08 18:58:21,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:21,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3488 states and 4689 transitions. [2019-09-08 18:58:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 18:58:21,302 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:21,303 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:21,303 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:21,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1252344950, now seen corresponding path program 1 times [2019-09-08 18:58:21,304 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:21,304 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:21,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:21,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:21,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-08 18:58:21,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:21,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:21,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:21,635 INFO L87 Difference]: Start difference. First operand 3488 states and 4689 transitions. Second operand 3 states. [2019-09-08 18:58:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:21,733 INFO L93 Difference]: Finished difference Result 6878 states and 9279 transitions. [2019-09-08 18:58:21,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:21,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 18:58:21,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:21,747 INFO L225 Difference]: With dead ends: 6878 [2019-09-08 18:58:21,747 INFO L226 Difference]: Without dead ends: 3490 [2019-09-08 18:58:21,760 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3490 states. [2019-09-08 18:58:21,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3490 to 3490. [2019-09-08 18:58:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-09-08 18:58:21,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4691 transitions. [2019-09-08 18:58:21,872 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4691 transitions. Word has length 314 [2019-09-08 18:58:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:21,873 INFO L475 AbstractCegarLoop]: Abstraction has 3490 states and 4691 transitions. [2019-09-08 18:58:21,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4691 transitions. [2019-09-08 18:58:21,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 18:58:21,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:21,880 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:21,880 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:21,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:21,881 INFO L82 PathProgramCache]: Analyzing trace with hash -376325944, now seen corresponding path program 1 times [2019-09-08 18:58:21,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:21,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:21,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:21,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:21,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:21,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:22,233 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-08 18:58:22,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:22,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 18:58:22,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 18:58:22,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 18:58:22,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:22,235 INFO L87 Difference]: Start difference. First operand 3490 states and 4691 transitions. Second operand 7 states. [2019-09-08 18:58:22,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:22,373 INFO L93 Difference]: Finished difference Result 6886 states and 9309 transitions. [2019-09-08 18:58:22,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 18:58:22,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 314 [2019-09-08 18:58:22,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:22,387 INFO L225 Difference]: With dead ends: 6886 [2019-09-08 18:58:22,388 INFO L226 Difference]: Without dead ends: 3496 [2019-09-08 18:58:22,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3496 states. [2019-09-08 18:58:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3496 to 3490. [2019-09-08 18:58:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-09-08 18:58:22,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4690 transitions. [2019-09-08 18:58:22,611 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4690 transitions. Word has length 314 [2019-09-08 18:58:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:22,612 INFO L475 AbstractCegarLoop]: Abstraction has 3490 states and 4690 transitions. [2019-09-08 18:58:22,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 18:58:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4690 transitions. [2019-09-08 18:58:22,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 18:58:22,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:22,619 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:22,619 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:22,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:22,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2065269686, now seen corresponding path program 1 times [2019-09-08 18:58:22,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:22,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:22,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:22,949 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-08 18:58:22,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:22,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:22,951 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:22,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:22,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:22,956 INFO L87 Difference]: Start difference. First operand 3490 states and 4690 transitions. Second operand 3 states. [2019-09-08 18:58:26,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:26,441 INFO L93 Difference]: Finished difference Result 6882 states and 9282 transitions. [2019-09-08 18:58:26,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:26,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 18:58:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:26,453 INFO L225 Difference]: With dead ends: 6882 [2019-09-08 18:58:26,454 INFO L226 Difference]: Without dead ends: 3492 [2019-09-08 18:58:26,467 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:26,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3492 states. [2019-09-08 18:58:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3492 to 3490. [2019-09-08 18:58:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-09-08 18:58:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4652 transitions. [2019-09-08 18:58:26,569 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4652 transitions. Word has length 314 [2019-09-08 18:58:26,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:26,570 INFO L475 AbstractCegarLoop]: Abstraction has 3490 states and 4652 transitions. [2019-09-08 18:58:26,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:26,570 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4652 transitions. [2019-09-08 18:58:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 18:58:26,579 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:26,580 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:26,580 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:26,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:26,580 INFO L82 PathProgramCache]: Analyzing trace with hash -345306137, now seen corresponding path program 1 times [2019-09-08 18:58:26,580 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:26,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:26,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:26,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:26,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:26,871 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-08 18:58:26,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:26,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:26,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:26,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:26,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:26,873 INFO L87 Difference]: Start difference. First operand 3490 states and 4652 transitions. Second operand 3 states. [2019-09-08 18:58:27,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:27,053 INFO L93 Difference]: Finished difference Result 6918 states and 9246 transitions. [2019-09-08 18:58:27,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:27,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 314 [2019-09-08 18:58:27,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:27,067 INFO L225 Difference]: With dead ends: 6918 [2019-09-08 18:58:27,067 INFO L226 Difference]: Without dead ends: 3528 [2019-09-08 18:58:27,078 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:27,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2019-09-08 18:58:27,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3528. [2019-09-08 18:58:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3528 states. [2019-09-08 18:58:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 4688 transitions. [2019-09-08 18:58:27,260 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 4688 transitions. Word has length 314 [2019-09-08 18:58:27,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:27,261 INFO L475 AbstractCegarLoop]: Abstraction has 3528 states and 4688 transitions. [2019-09-08 18:58:27,261 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:27,261 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 4688 transitions. [2019-09-08 18:58:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 18:58:27,269 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:27,269 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:27,270 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:27,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:27,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2052164393, now seen corresponding path program 1 times [2019-09-08 18:58:27,270 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:27,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:27,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:27,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:27,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:27,641 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-08 18:58:27,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:27,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:27,642 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:27,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:27,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:27,643 INFO L87 Difference]: Start difference. First operand 3528 states and 4688 transitions. Second operand 6 states. [2019-09-08 18:58:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:27,948 INFO L93 Difference]: Finished difference Result 6970 states and 9321 transitions. [2019-09-08 18:58:27,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:27,948 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 314 [2019-09-08 18:58:27,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:27,960 INFO L225 Difference]: With dead ends: 6970 [2019-09-08 18:58:27,961 INFO L226 Difference]: Without dead ends: 3542 [2019-09-08 18:58:27,973 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3542 states. [2019-09-08 18:58:28,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3542 to 3540. [2019-09-08 18:58:28,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3540 states. [2019-09-08 18:58:28,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3540 states to 3540 states and 4735 transitions. [2019-09-08 18:58:28,076 INFO L78 Accepts]: Start accepts. Automaton has 3540 states and 4735 transitions. Word has length 314 [2019-09-08 18:58:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:28,077 INFO L475 AbstractCegarLoop]: Abstraction has 3540 states and 4735 transitions. [2019-09-08 18:58:28,077 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:28,077 INFO L276 IsEmpty]: Start isEmpty. Operand 3540 states and 4735 transitions. [2019-09-08 18:58:28,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2019-09-08 18:58:28,085 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:28,085 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:28,086 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:28,086 INFO L82 PathProgramCache]: Analyzing trace with hash 515368444, now seen corresponding path program 1 times [2019-09-08 18:58:28,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:28,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:28,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:28,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:28,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:28,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2019-09-08 18:58:28,499 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:28,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:28,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:28,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:28,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:28,500 INFO L87 Difference]: Start difference. First operand 3540 states and 4735 transitions. Second operand 6 states. [2019-09-08 18:58:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:31,863 INFO L93 Difference]: Finished difference Result 6987 states and 9357 transitions. [2019-09-08 18:58:31,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:31,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 316 [2019-09-08 18:58:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:31,874 INFO L225 Difference]: With dead ends: 6987 [2019-09-08 18:58:31,875 INFO L226 Difference]: Without dead ends: 3508 [2019-09-08 18:58:31,882 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:31,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3508 states. [2019-09-08 18:58:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3508 to 3490. [2019-09-08 18:58:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3490 states. [2019-09-08 18:58:32,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3490 states to 3490 states and 4679 transitions. [2019-09-08 18:58:32,082 INFO L78 Accepts]: Start accepts. Automaton has 3490 states and 4679 transitions. Word has length 316 [2019-09-08 18:58:32,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:32,083 INFO L475 AbstractCegarLoop]: Abstraction has 3490 states and 4679 transitions. [2019-09-08 18:58:32,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:32,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3490 states and 4679 transitions. [2019-09-08 18:58:32,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 18:58:32,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:32,088 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:32,088 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:32,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:32,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1065586163, now seen corresponding path program 1 times [2019-09-08 18:58:32,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:32,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:32,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:32,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:32,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:32,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:32,506 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-08 18:58:32,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:32,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:32,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:32,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:32,508 INFO L87 Difference]: Start difference. First operand 3490 states and 4679 transitions. Second operand 6 states. [2019-09-08 18:58:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:32,703 INFO L93 Difference]: Finished difference Result 6887 states and 9254 transitions. [2019-09-08 18:58:32,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:32,704 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 333 [2019-09-08 18:58:32,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:32,719 INFO L225 Difference]: With dead ends: 6887 [2019-09-08 18:58:32,720 INFO L226 Difference]: Without dead ends: 3497 [2019-09-08 18:58:32,728 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3497 states. [2019-09-08 18:58:32,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3497 to 3495. [2019-09-08 18:58:32,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3495 states. [2019-09-08 18:58:32,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 4686 transitions. [2019-09-08 18:58:32,841 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 4686 transitions. Word has length 333 [2019-09-08 18:58:32,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:32,842 INFO L475 AbstractCegarLoop]: Abstraction has 3495 states and 4686 transitions. [2019-09-08 18:58:32,842 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 4686 transitions. [2019-09-08 18:58:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 18:58:32,847 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:32,847 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:32,848 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:32,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:32,848 INFO L82 PathProgramCache]: Analyzing trace with hash -623357579, now seen corresponding path program 1 times [2019-09-08 18:58:32,848 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:32,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:32,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:32,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:32,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:33,230 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-08 18:58:33,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:33,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 18:58:33,232 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 18:58:33,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 18:58:33,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:33,232 INFO L87 Difference]: Start difference. First operand 3495 states and 4686 transitions. Second operand 7 states. [2019-09-08 18:58:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:33,355 INFO L93 Difference]: Finished difference Result 6890 states and 9262 transitions. [2019-09-08 18:58:33,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 18:58:33,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 333 [2019-09-08 18:58:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:33,369 INFO L225 Difference]: With dead ends: 6890 [2019-09-08 18:58:33,369 INFO L226 Difference]: Without dead ends: 3495 [2019-09-08 18:58:33,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:33,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2019-09-08 18:58:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3495. [2019-09-08 18:58:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3495 states. [2019-09-08 18:58:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 4685 transitions. [2019-09-08 18:58:33,477 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 4685 transitions. Word has length 333 [2019-09-08 18:58:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:33,478 INFO L475 AbstractCegarLoop]: Abstraction has 3495 states and 4685 transitions. [2019-09-08 18:58:33,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 18:58:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 4685 transitions. [2019-09-08 18:58:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2019-09-08 18:58:33,483 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:33,483 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:33,484 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:33,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:33,484 INFO L82 PathProgramCache]: Analyzing trace with hash -827974598, now seen corresponding path program 1 times [2019-09-08 18:58:33,484 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:33,484 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:33,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:33,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:33,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-08 18:58:34,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:34,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:34,463 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:34,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:34,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:34,463 INFO L87 Difference]: Start difference. First operand 3495 states and 4685 transitions. Second operand 6 states. [2019-09-08 18:58:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:34,608 INFO L93 Difference]: Finished difference Result 6909 states and 9283 transitions. [2019-09-08 18:58:34,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:34,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 333 [2019-09-08 18:58:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:34,621 INFO L225 Difference]: With dead ends: 6909 [2019-09-08 18:58:34,622 INFO L226 Difference]: Without dead ends: 3514 [2019-09-08 18:58:34,629 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3514 states. [2019-09-08 18:58:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3514 to 3502. [2019-09-08 18:58:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3502 states. [2019-09-08 18:58:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3502 states to 3502 states and 4695 transitions. [2019-09-08 18:58:34,736 INFO L78 Accepts]: Start accepts. Automaton has 3502 states and 4695 transitions. Word has length 333 [2019-09-08 18:58:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:34,737 INFO L475 AbstractCegarLoop]: Abstraction has 3502 states and 4695 transitions. [2019-09-08 18:58:34,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 3502 states and 4695 transitions. [2019-09-08 18:58:34,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2019-09-08 18:58:34,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:34,743 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:34,743 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:34,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1251942056, now seen corresponding path program 1 times [2019-09-08 18:58:34,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:34,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:34,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:34,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:35,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:35,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 18:58:35,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 18:58:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 18:58:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:35,126 INFO L87 Difference]: Start difference. First operand 3502 states and 4695 transitions. Second operand 7 states. [2019-09-08 18:58:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:35,250 INFO L93 Difference]: Finished difference Result 6696 states and 8956 transitions. [2019-09-08 18:58:35,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 18:58:35,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 314 [2019-09-08 18:58:35,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:35,268 INFO L225 Difference]: With dead ends: 6696 [2019-09-08 18:58:35,269 INFO L226 Difference]: Without dead ends: 3294 [2019-09-08 18:58:35,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2019-09-08 18:58:35,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3291. [2019-09-08 18:58:35,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3291 states. [2019-09-08 18:58:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3291 states to 3291 states and 4365 transitions. [2019-09-08 18:58:35,384 INFO L78 Accepts]: Start accepts. Automaton has 3291 states and 4365 transitions. Word has length 314 [2019-09-08 18:58:35,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:35,384 INFO L475 AbstractCegarLoop]: Abstraction has 3291 states and 4365 transitions. [2019-09-08 18:58:35,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 18:58:35,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3291 states and 4365 transitions. [2019-09-08 18:58:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 18:58:35,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:35,391 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:35,391 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:35,392 INFO L82 PathProgramCache]: Analyzing trace with hash 89414336, now seen corresponding path program 1 times [2019-09-08 18:58:35,392 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:35,392 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:35,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:35,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:35,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:35,752 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:35,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:35,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:35,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:35,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:35,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:35,754 INFO L87 Difference]: Start difference. First operand 3291 states and 4365 transitions. Second operand 3 states. [2019-09-08 18:58:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:35,841 INFO L93 Difference]: Finished difference Result 6484 states and 8619 transitions. [2019-09-08 18:58:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:35,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-09-08 18:58:35,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:35,851 INFO L225 Difference]: With dead ends: 6484 [2019-09-08 18:58:35,852 INFO L226 Difference]: Without dead ends: 3293 [2019-09-08 18:58:35,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3293 states. [2019-09-08 18:58:36,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3293 to 3293. [2019-09-08 18:58:36,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3293 states. [2019-09-08 18:58:36,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3293 states to 3293 states and 4367 transitions. [2019-09-08 18:58:36,025 INFO L78 Accepts]: Start accepts. Automaton has 3293 states and 4367 transitions. Word has length 332 [2019-09-08 18:58:36,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:36,026 INFO L475 AbstractCegarLoop]: Abstraction has 3293 states and 4367 transitions. [2019-09-08 18:58:36,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3293 states and 4367 transitions. [2019-09-08 18:58:36,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-09-08 18:58:36,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:36,035 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:36,035 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:36,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:36,036 INFO L82 PathProgramCache]: Analyzing trace with hash 965433342, now seen corresponding path program 1 times [2019-09-08 18:58:36,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:36,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:36,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:36,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:36,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:36,454 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:36,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:36,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:36,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:36,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:36,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:36,456 INFO L87 Difference]: Start difference. First operand 3293 states and 4367 transitions. Second operand 6 states. [2019-09-08 18:58:36,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:36,758 INFO L93 Difference]: Finished difference Result 6494 states and 8631 transitions. [2019-09-08 18:58:36,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:36,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 332 [2019-09-08 18:58:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:36,771 INFO L225 Difference]: With dead ends: 6494 [2019-09-08 18:58:36,771 INFO L226 Difference]: Without dead ends: 3301 [2019-09-08 18:58:36,778 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2019-09-08 18:58:36,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3299. [2019-09-08 18:58:36,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3299 states. [2019-09-08 18:58:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3299 states to 3299 states and 4373 transitions. [2019-09-08 18:58:36,869 INFO L78 Accepts]: Start accepts. Automaton has 3299 states and 4373 transitions. Word has length 332 [2019-09-08 18:58:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:36,870 INFO L475 AbstractCegarLoop]: Abstraction has 3299 states and 4373 transitions. [2019-09-08 18:58:36,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 3299 states and 4373 transitions. [2019-09-08 18:58:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 18:58:36,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:36,876 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:36,876 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1005400751, now seen corresponding path program 1 times [2019-09-08 18:58:36,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:36,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:36,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:36,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:36,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:37,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:37,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:37,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:37,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:37,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:37,314 INFO L87 Difference]: Start difference. First operand 3299 states and 4373 transitions. Second operand 6 states. [2019-09-08 18:58:37,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:37,442 INFO L93 Difference]: Finished difference Result 6505 states and 8639 transitions. [2019-09-08 18:58:37,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:37,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 334 [2019-09-08 18:58:37,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:37,454 INFO L225 Difference]: With dead ends: 6505 [2019-09-08 18:58:37,454 INFO L226 Difference]: Without dead ends: 3306 [2019-09-08 18:58:37,461 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3306 states. [2019-09-08 18:58:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3306 to 3304. [2019-09-08 18:58:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3304 states. [2019-09-08 18:58:37,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3304 states to 3304 states and 4380 transitions. [2019-09-08 18:58:37,555 INFO L78 Accepts]: Start accepts. Automaton has 3304 states and 4380 transitions. Word has length 334 [2019-09-08 18:58:37,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:37,556 INFO L475 AbstractCegarLoop]: Abstraction has 3304 states and 4380 transitions. [2019-09-08 18:58:37,556 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:37,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3304 states and 4380 transitions. [2019-09-08 18:58:37,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2019-09-08 18:58:37,561 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:37,562 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:37,562 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:37,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:37,564 INFO L82 PathProgramCache]: Analyzing trace with hash 633480344, now seen corresponding path program 1 times [2019-09-08 18:58:37,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:37,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:37,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:37,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:37,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:37,937 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:37,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:37,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:37,940 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:37,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:37,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:37,941 INFO L87 Difference]: Start difference. First operand 3304 states and 4380 transitions. Second operand 6 states. [2019-09-08 18:58:38,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:38,106 INFO L93 Difference]: Finished difference Result 6324 states and 8353 transitions. [2019-09-08 18:58:38,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:38,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 334 [2019-09-08 18:58:38,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:38,114 INFO L225 Difference]: With dead ends: 6324 [2019-09-08 18:58:38,115 INFO L226 Difference]: Without dead ends: 3120 [2019-09-08 18:58:38,121 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:38,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3120 states. [2019-09-08 18:58:38,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3120 to 3113. [2019-09-08 18:58:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3113 states. [2019-09-08 18:58:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3113 states to 3113 states and 4079 transitions. [2019-09-08 18:58:38,206 INFO L78 Accepts]: Start accepts. Automaton has 3113 states and 4079 transitions. Word has length 334 [2019-09-08 18:58:38,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:38,207 INFO L475 AbstractCegarLoop]: Abstraction has 3113 states and 4079 transitions. [2019-09-08 18:58:38,207 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 3113 states and 4079 transitions. [2019-09-08 18:58:38,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 18:58:38,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:38,212 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:38,216 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:38,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:38,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1561451055, now seen corresponding path program 1 times [2019-09-08 18:58:38,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:38,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:38,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:38,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:38,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:38,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:38,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:38,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:38,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:38,522 INFO L87 Difference]: Start difference. First operand 3113 states and 4079 transitions. Second operand 3 states. [2019-09-08 18:58:38,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:38,623 INFO L93 Difference]: Finished difference Result 6128 states and 8047 transitions. [2019-09-08 18:58:38,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:38,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 337 [2019-09-08 18:58:38,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:38,633 INFO L225 Difference]: With dead ends: 6128 [2019-09-08 18:58:38,634 INFO L226 Difference]: Without dead ends: 3115 [2019-09-08 18:58:38,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3115 states. [2019-09-08 18:58:38,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3115 to 3115. [2019-09-08 18:58:38,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3115 states. [2019-09-08 18:58:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 4081 transitions. [2019-09-08 18:58:38,751 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 4081 transitions. Word has length 337 [2019-09-08 18:58:38,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:38,752 INFO L475 AbstractCegarLoop]: Abstraction has 3115 states and 4081 transitions. [2019-09-08 18:58:38,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 4081 transitions. [2019-09-08 18:58:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2019-09-08 18:58:38,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:38,758 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:38,758 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:38,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:38,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1127721969, now seen corresponding path program 1 times [2019-09-08 18:58:38,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:38,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:38,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:38,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:38,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:38,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:39,105 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:39,106 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:39,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:39,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:39,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:39,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:39,107 INFO L87 Difference]: Start difference. First operand 3115 states and 4081 transitions. Second operand 6 states. [2019-09-08 18:58:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:39,395 INFO L93 Difference]: Finished difference Result 6138 states and 8059 transitions. [2019-09-08 18:58:39,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:39,396 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 337 [2019-09-08 18:58:39,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:39,404 INFO L225 Difference]: With dead ends: 6138 [2019-09-08 18:58:39,405 INFO L226 Difference]: Without dead ends: 3123 [2019-09-08 18:58:39,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3123 states. [2019-09-08 18:58:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3123 to 3121. [2019-09-08 18:58:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3121 states. [2019-09-08 18:58:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 4087 transitions. [2019-09-08 18:58:39,491 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 4087 transitions. Word has length 337 [2019-09-08 18:58:39,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:39,492 INFO L475 AbstractCegarLoop]: Abstraction has 3121 states and 4087 transitions. [2019-09-08 18:58:39,492 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:39,492 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 4087 transitions. [2019-09-08 18:58:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 18:58:39,498 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:39,498 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:39,498 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:39,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:39,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1958558238, now seen corresponding path program 1 times [2019-09-08 18:58:39,499 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:39,499 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:39,501 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:39,501 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:39,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:39,848 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:39,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:39,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:39,850 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:39,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:39,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:39,850 INFO L87 Difference]: Start difference. First operand 3121 states and 4087 transitions. Second operand 6 states. [2019-09-08 18:58:39,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:39,955 INFO L93 Difference]: Finished difference Result 3615 states and 4699 transitions. [2019-09-08 18:58:39,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:39,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 339 [2019-09-08 18:58:39,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:39,966 INFO L225 Difference]: With dead ends: 3615 [2019-09-08 18:58:39,966 INFO L226 Difference]: Without dead ends: 3128 [2019-09-08 18:58:39,969 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:39,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2019-09-08 18:58:40,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 3126. [2019-09-08 18:58:40,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3126 states. [2019-09-08 18:58:40,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 4094 transitions. [2019-09-08 18:58:40,110 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 4094 transitions. Word has length 339 [2019-09-08 18:58:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:40,110 INFO L475 AbstractCegarLoop]: Abstraction has 3126 states and 4094 transitions. [2019-09-08 18:58:40,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 4094 transitions. [2019-09-08 18:58:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2019-09-08 18:58:40,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:40,117 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:40,117 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:40,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1264001449, now seen corresponding path program 1 times [2019-09-08 18:58:40,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:40,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:40,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:40,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:40,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:40,455 INFO L134 CoverageAnalysis]: Checked inductivity of 294 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:40,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:40,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:40,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:40,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:40,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:40,457 INFO L87 Difference]: Start difference. First operand 3126 states and 4094 transitions. Second operand 6 states. [2019-09-08 18:58:40,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:40,567 INFO L93 Difference]: Finished difference Result 5916 states and 7760 transitions. [2019-09-08 18:58:40,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:40,567 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 339 [2019-09-08 18:58:40,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:40,575 INFO L225 Difference]: With dead ends: 5916 [2019-09-08 18:58:40,576 INFO L226 Difference]: Without dead ends: 2890 [2019-09-08 18:58:40,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2019-09-08 18:58:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2883. [2019-09-08 18:58:40,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2883 states. [2019-09-08 18:58:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 3772 transitions. [2019-09-08 18:58:40,659 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 3772 transitions. Word has length 339 [2019-09-08 18:58:40,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:40,660 INFO L475 AbstractCegarLoop]: Abstraction has 2883 states and 3772 transitions. [2019-09-08 18:58:40,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 3772 transitions. [2019-09-08 18:58:40,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2019-09-08 18:58:40,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:40,671 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:40,671 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:40,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:40,671 INFO L82 PathProgramCache]: Analyzing trace with hash 187539277, now seen corresponding path program 1 times [2019-09-08 18:58:40,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:40,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:40,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:40,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:40,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2019-09-08 18:58:40,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:40,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:40,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:40,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:40,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:40,985 INFO L87 Difference]: Start difference. First operand 2883 states and 3772 transitions. Second operand 6 states. [2019-09-08 18:58:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:41,073 INFO L93 Difference]: Finished difference Result 3789 states and 4911 transitions. [2019-09-08 18:58:41,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:41,073 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 369 [2019-09-08 18:58:41,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:41,083 INFO L225 Difference]: With dead ends: 3789 [2019-09-08 18:58:41,083 INFO L226 Difference]: Without dead ends: 2883 [2019-09-08 18:58:41,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:41,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2019-09-08 18:58:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2881. [2019-09-08 18:58:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-09-08 18:58:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 3766 transitions. [2019-09-08 18:58:41,161 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 3766 transitions. Word has length 369 [2019-09-08 18:58:41,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:41,161 INFO L475 AbstractCegarLoop]: Abstraction has 2881 states and 3766 transitions. [2019-09-08 18:58:41,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:41,162 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 3766 transitions. [2019-09-08 18:58:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2019-09-08 18:58:41,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:41,169 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:41,169 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:41,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1901174290, now seen corresponding path program 1 times [2019-09-08 18:58:41,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:41,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:41,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:41,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:41,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:41,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:41,467 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:41,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:41,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:41,468 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:41,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:41,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:41,469 INFO L87 Difference]: Start difference. First operand 2881 states and 3766 transitions. Second operand 6 states. [2019-09-08 18:58:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:41,571 INFO L93 Difference]: Finished difference Result 3785 states and 4901 transitions. [2019-09-08 18:58:41,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:41,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 382 [2019-09-08 18:58:41,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:41,579 INFO L225 Difference]: With dead ends: 3785 [2019-09-08 18:58:41,580 INFO L226 Difference]: Without dead ends: 2881 [2019-09-08 18:58:41,582 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2019-09-08 18:58:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2879. [2019-09-08 18:58:41,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2879 states. [2019-09-08 18:58:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2879 states to 2879 states and 3762 transitions. [2019-09-08 18:58:41,661 INFO L78 Accepts]: Start accepts. Automaton has 2879 states and 3762 transitions. Word has length 382 [2019-09-08 18:58:41,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:41,662 INFO L475 AbstractCegarLoop]: Abstraction has 2879 states and 3762 transitions. [2019-09-08 18:58:41,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:41,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2879 states and 3762 transitions. [2019-09-08 18:58:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2019-09-08 18:58:41,670 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:41,671 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:41,671 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:41,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:41,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1060481437, now seen corresponding path program 1 times [2019-09-08 18:58:41,672 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:41,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:41,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:41,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:41,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2019-09-08 18:58:42,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:42,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 18:58:42,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 18:58:42,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 18:58:42,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 18:58:42,046 INFO L87 Difference]: Start difference. First operand 2879 states and 3762 transitions. Second operand 6 states. [2019-09-08 18:58:42,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:42,125 INFO L93 Difference]: Finished difference Result 3781 states and 4895 transitions. [2019-09-08 18:58:42,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 18:58:42,126 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 381 [2019-09-08 18:58:42,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:42,133 INFO L225 Difference]: With dead ends: 3781 [2019-09-08 18:58:42,133 INFO L226 Difference]: Without dead ends: 2879 [2019-09-08 18:58:42,136 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 18:58:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2879 states. [2019-09-08 18:58:42,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2879 to 2877. [2019-09-08 18:58:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2877 states. [2019-09-08 18:58:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2877 states to 2877 states and 3758 transitions. [2019-09-08 18:58:42,208 INFO L78 Accepts]: Start accepts. Automaton has 2877 states and 3758 transitions. Word has length 381 [2019-09-08 18:58:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:42,209 INFO L475 AbstractCegarLoop]: Abstraction has 2877 states and 3758 transitions. [2019-09-08 18:58:42,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 18:58:42,209 INFO L276 IsEmpty]: Start isEmpty. Operand 2877 states and 3758 transitions. [2019-09-08 18:58:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 18:58:42,215 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:42,216 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:42,216 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash 167778988, now seen corresponding path program 1 times [2019-09-08 18:58:42,216 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:42,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:42,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:42,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2019-09-08 18:58:42,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 18:58:42,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 18:58:42,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:44,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 5196 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 18:58:44,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 18:58:44,465 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2019-09-08 18:58:44,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 18:58:44,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-09-08 18:58:44,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 18:58:44,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 18:58:44,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 18:58:44,494 INFO L87 Difference]: Start difference. First operand 2877 states and 3758 transitions. Second operand 10 states. [2019-09-08 18:58:51,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:51,910 INFO L93 Difference]: Finished difference Result 6959 states and 9128 transitions. [2019-09-08 18:58:51,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-08 18:58:51,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 388 [2019-09-08 18:58:51,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:51,942 INFO L225 Difference]: With dead ends: 6959 [2019-09-08 18:58:51,943 INFO L226 Difference]: Without dead ends: 6044 [2019-09-08 18:58:51,949 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 391 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2019-09-08 18:58:51,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6044 states. [2019-09-08 18:58:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6044 to 2038. [2019-09-08 18:58:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2038 states. [2019-09-08 18:58:52,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 2672 transitions. [2019-09-08 18:58:52,134 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 2672 transitions. Word has length 388 [2019-09-08 18:58:52,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:52,135 INFO L475 AbstractCegarLoop]: Abstraction has 2038 states and 2672 transitions. [2019-09-08 18:58:52,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 18:58:52,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 2672 transitions. [2019-09-08 18:58:52,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-08 18:58:52,142 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:52,142 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:52,142 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:52,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:52,143 INFO L82 PathProgramCache]: Analyzing trace with hash -848787821, now seen corresponding path program 1 times [2019-09-08 18:58:52,143 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:52,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:52,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:52,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:52,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:52,824 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-08 18:58:52,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:52,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:58:52,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:58:52,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:58:52,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:52,826 INFO L87 Difference]: Start difference. First operand 2038 states and 2672 transitions. Second operand 3 states. [2019-09-08 18:58:52,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:58:52,897 INFO L93 Difference]: Finished difference Result 3977 states and 5238 transitions. [2019-09-08 18:58:52,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:58:52,897 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2019-09-08 18:58:52,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:58:52,910 INFO L225 Difference]: With dead ends: 3977 [2019-09-08 18:58:52,910 INFO L226 Difference]: Without dead ends: 2039 [2019-09-08 18:58:52,924 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:58:52,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2019-09-08 18:58:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2019-09-08 18:58:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2039 states. [2019-09-08 18:58:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2673 transitions. [2019-09-08 18:58:53,048 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2673 transitions. Word has length 402 [2019-09-08 18:58:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:58:53,048 INFO L475 AbstractCegarLoop]: Abstraction has 2039 states and 2673 transitions. [2019-09-08 18:58:53,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:58:53,049 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2673 transitions. [2019-09-08 18:58:53,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-09-08 18:58:53,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:58:53,059 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:58:53,059 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:58:53,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:58:53,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2006931116, now seen corresponding path program 1 times [2019-09-08 18:58:53,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:58:53,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:58:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:53,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:58:53,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:58:53,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:58:53,881 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-09-08 18:58:53,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:58:53,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 18:58:53,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 18:58:53,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 18:58:53,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 18:58:53,882 INFO L87 Difference]: Start difference. First operand 2039 states and 2673 transitions. Second operand 5 states. [2019-09-08 18:59:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:59:17,163 INFO L93 Difference]: Finished difference Result 3989 states and 5255 transitions. [2019-09-08 18:59:17,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 18:59:17,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 419 [2019-09-08 18:59:17,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:59:17,174 INFO L225 Difference]: With dead ends: 3989 [2019-09-08 18:59:17,174 INFO L226 Difference]: Without dead ends: 2050 [2019-09-08 18:59:17,178 INFO L628 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-09-08 18:59:17,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2019-09-08 18:59:17,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2043. [2019-09-08 18:59:17,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2043 states. [2019-09-08 18:59:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2043 states to 2043 states and 2679 transitions. [2019-09-08 18:59:17,247 INFO L78 Accepts]: Start accepts. Automaton has 2043 states and 2679 transitions. Word has length 419 [2019-09-08 18:59:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:59:17,248 INFO L475 AbstractCegarLoop]: Abstraction has 2043 states and 2679 transitions. [2019-09-08 18:59:17,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 18:59:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 2043 states and 2679 transitions. [2019-09-08 18:59:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-08 18:59:17,254 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:59:17,254 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:59:17,254 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:59:17,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:59:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1282608655, now seen corresponding path program 1 times [2019-09-08 18:59:17,255 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:59:17,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:59:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:59:17,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:59:17,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:59:17,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:59:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-08 18:59:18,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:59:18,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 18:59:18,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 18:59:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 18:59:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 18:59:18,208 INFO L87 Difference]: Start difference. First operand 2043 states and 2679 transitions. Second operand 5 states. [2019-09-08 18:59:43,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:59:43,602 INFO L93 Difference]: Finished difference Result 3999 states and 5270 transitions. [2019-09-08 18:59:43,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 18:59:43,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 402 [2019-09-08 18:59:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:59:43,610 INFO L225 Difference]: With dead ends: 3999 [2019-09-08 18:59:43,611 INFO L226 Difference]: Without dead ends: 2056 [2019-09-08 18:59:43,615 INFO L628 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-09-08 18:59:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2056 states. [2019-09-08 18:59:43,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2056 to 2047. [2019-09-08 18:59:43,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2019-09-08 18:59:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 2685 transitions. [2019-09-08 18:59:43,682 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 2685 transitions. Word has length 402 [2019-09-08 18:59:43,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:59:43,683 INFO L475 AbstractCegarLoop]: Abstraction has 2047 states and 2685 transitions. [2019-09-08 18:59:43,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 18:59:43,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 2685 transitions. [2019-09-08 18:59:43,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2019-09-08 18:59:43,690 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:59:43,691 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:59:43,691 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:59:43,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:59:43,691 INFO L82 PathProgramCache]: Analyzing trace with hash 271491405, now seen corresponding path program 1 times [2019-09-08 18:59:43,691 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:59:43,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:59:43,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:59:43,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:59:43,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:59:44,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:59:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-08 18:59:44,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:59:44,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 18:59:44,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 18:59:44,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 18:59:44,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:59:44,517 INFO L87 Difference]: Start difference. First operand 2047 states and 2685 transitions. Second operand 3 states. [2019-09-08 18:59:44,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:59:44,591 INFO L93 Difference]: Finished difference Result 4110 states and 5443 transitions. [2019-09-08 18:59:44,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 18:59:44,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 402 [2019-09-08 18:59:44,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:59:44,598 INFO L225 Difference]: With dead ends: 4110 [2019-09-08 18:59:44,598 INFO L226 Difference]: Without dead ends: 2163 [2019-09-08 18:59:44,603 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 18:59:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2019-09-08 18:59:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 2046. [2019-09-08 18:59:44,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-09-08 18:59:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2682 transitions. [2019-09-08 18:59:44,674 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2682 transitions. Word has length 402 [2019-09-08 18:59:44,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:59:44,675 INFO L475 AbstractCegarLoop]: Abstraction has 2046 states and 2682 transitions. [2019-09-08 18:59:44,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 18:59:44,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2682 transitions. [2019-09-08 18:59:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 18:59:44,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:59:44,682 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:59:44,682 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:59:44,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:59:44,683 INFO L82 PathProgramCache]: Analyzing trace with hash 756703897, now seen corresponding path program 1 times [2019-09-08 18:59:44,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:59:44,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:59:44,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:59:44,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:59:44,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:59:45,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 18:59:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 308 trivial. 0 not checked. [2019-09-08 18:59:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 18:59:45,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 18:59:45,401 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 18:59:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 18:59:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 18:59:45,402 INFO L87 Difference]: Start difference. First operand 2046 states and 2682 transitions. Second operand 4 states. [2019-09-08 18:59:59,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 18:59:59,717 INFO L93 Difference]: Finished difference Result 3972 states and 5220 transitions. [2019-09-08 18:59:59,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 18:59:59,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 404 [2019-09-08 18:59:59,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 18:59:59,722 INFO L225 Difference]: With dead ends: 3972 [2019-09-08 18:59:59,723 INFO L226 Difference]: Without dead ends: 2026 [2019-09-08 18:59:59,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 18:59:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2019-09-08 18:59:59,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2025. [2019-09-08 18:59:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-09-08 18:59:59,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 2653 transitions. [2019-09-08 18:59:59,803 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 2653 transitions. Word has length 404 [2019-09-08 18:59:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 18:59:59,803 INFO L475 AbstractCegarLoop]: Abstraction has 2025 states and 2653 transitions. [2019-09-08 18:59:59,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 18:59:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 2653 transitions. [2019-09-08 18:59:59,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-08 18:59:59,810 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 18:59:59,810 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 18:59:59,811 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 18:59:59,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 18:59:59,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1389230884, now seen corresponding path program 1 times [2019-09-08 18:59:59,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 18:59:59,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 18:59:59,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 18:59:59,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 18:59:59,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 19:00:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 19:00:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-09-08 19:00:00,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 19:00:00,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 19:00:00,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 19:00:00,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 19:00:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 19:00:00,438 INFO L87 Difference]: Start difference. First operand 2025 states and 2653 transitions. Second operand 4 states. [2019-09-08 19:00:06,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 19:00:06,194 INFO L93 Difference]: Finished difference Result 2985 states and 3804 transitions. [2019-09-08 19:00:06,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 19:00:06,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 421 [2019-09-08 19:00:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 19:00:06,196 INFO L225 Difference]: With dead ends: 2985 [2019-09-08 19:00:06,197 INFO L226 Difference]: Without dead ends: 1060 [2019-09-08 19:00:06,199 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 19:00:06,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-09-08 19:00:06,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1059. [2019-09-08 19:00:06,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1059 states. [2019-09-08 19:00:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1059 states to 1059 states and 1264 transitions. [2019-09-08 19:00:06,231 INFO L78 Accepts]: Start accepts. Automaton has 1059 states and 1264 transitions. Word has length 421 [2019-09-08 19:00:06,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 19:00:06,232 INFO L475 AbstractCegarLoop]: Abstraction has 1059 states and 1264 transitions. [2019-09-08 19:00:06,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 19:00:06,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1059 states and 1264 transitions. [2019-09-08 19:00:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2019-09-08 19:00:06,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 19:00:06,236 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 19:00:06,237 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 19:00:06,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 19:00:06,237 INFO L82 PathProgramCache]: Analyzing trace with hash -320049860, now seen corresponding path program 1 times [2019-09-08 19:00:06,237 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 19:00:06,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 19:00:06,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 19:00:06,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 19:00:06,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 19:00:06,343 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2019-09-08 19:00:06,343 INFO L258 seRefinementStrategy]: Advancing trace checker [2019-09-08 19:00:06,343 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2019-09-08 19:00:06,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true